java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:09:20,161 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:09:20,164 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:09:20,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:09:20,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:09:20,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:09:20,187 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:09:20,197 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:09:20,202 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:09:20,205 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:09:20,207 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:09:20,209 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:09:20,209 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:09:20,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:09:20,213 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:09:20,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:09:20,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:09:20,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:09:20,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:09:20,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:09:20,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:09:20,230 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:09:20,233 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:09:20,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:09:20,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:09:20,236 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:09:20,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:09:20,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:09:20,239 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:09:20,240 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:09:20,240 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:09:20,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:09:20,243 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:09:20,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:09:20,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:09:20,245 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:09:20,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:09:20,246 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:09:20,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:09:20,247 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:09:20,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:09:20,249 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 18:09:20,282 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:09:20,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:09:20,284 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:09:20,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:09:20,287 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:09:20,288 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:09:20,288 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:09:20,288 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:09:20,288 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:09:20,288 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:09:20,289 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:09:20,289 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:09:20,290 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:09:20,290 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:09:20,290 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:09:20,291 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:09:20,291 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:09:20,291 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:09:20,291 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:09:20,292 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:09:20,292 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:09:20,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:09:20,292 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:09:20,292 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:09:20,293 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:09:20,293 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:09:20,293 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:09:20,293 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:09:20,293 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:09:20,553 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:09:20,566 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:09:20,571 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:09:20,572 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:09:20,573 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:09:20,573 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-13 18:09:20,646 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7220db667/9b209984a1e5432eacf7dce158c32c61/FLAGe95f49420 [2019-10-13 18:09:21,184 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:09:21,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-2.i [2019-10-13 18:09:21,202 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7220db667/9b209984a1e5432eacf7dce158c32c61/FLAGe95f49420 [2019-10-13 18:09:21,546 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7220db667/9b209984a1e5432eacf7dce158c32c61 [2019-10-13 18:09:21,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:09:21,559 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:09:21,560 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:09:21,560 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:09:21,565 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:09:21,567 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:09:21" (1/1) ... [2019-10-13 18:09:21,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d3457a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:21, skipping insertion in model container [2019-10-13 18:09:21,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:09:21" (1/1) ... [2019-10-13 18:09:21,580 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:09:21,642 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:09:22,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:09:22,096 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:09:22,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:09:22,225 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:09:22,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22 WrapperNode [2019-10-13 18:09:22,227 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:09:22,227 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:09:22,228 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:09:22,228 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:09:22,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... [2019-10-13 18:09:22,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... [2019-10-13 18:09:22,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... [2019-10-13 18:09:22,272 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... [2019-10-13 18:09:22,298 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... [2019-10-13 18:09:22,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... [2019-10-13 18:09:22,316 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... [2019-10-13 18:09:22,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:09:22,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:09:22,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:09:22,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:09:22,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:09:22,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:09:22,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:09:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 18:09:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 18:09:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-13 18:09:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-10-13 18:09:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-10-13 18:09:22,384 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-10-13 18:09:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-10-13 18:09:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-10-13 18:09:22,385 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:09:22,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:09:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 18:09:22,387 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 18:09:22,388 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:09:22,388 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:09:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:09:22,390 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:09:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:09:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:09:22,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:09:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:09:22,392 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:09:22,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:09:22,393 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:09:22,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:09:22,394 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:09:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:09:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:09:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:09:22,395 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:09:22,396 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:09:22,396 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:09:22,396 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:09:22,396 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:09:22,396 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:09:22,396 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:09:22,397 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:09:22,397 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:09:22,397 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:09:22,397 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:09:22,397 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:09:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:09:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:09:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:09:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:09:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:09:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:09:22,398 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:09:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:09:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:09:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:09:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:09:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:09:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:09:22,399 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:09:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:09:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:09:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:09:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:09:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:09:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:09:22,400 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:09:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:09:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:09:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:09:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:09:22,401 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:09:22,402 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:09:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:09:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:09:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:09:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:09:22,403 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:09:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:09:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:09:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:09:22,404 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:09:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:09:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:09:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:09:22,405 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:09:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:09:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:09:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:09:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:09:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:09:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:09:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:09:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:09:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:09:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:09:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:09:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:09:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:09:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:09:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:09:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:09:22,409 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:09:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:09:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:09:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:09:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:09:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:09:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:09:22,410 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:09:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:09:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:09:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:09:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:09:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:09:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:09:22,411 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-10-13 18:09:22,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 18:09:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:09:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:09:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-10-13 18:09:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-10-13 18:09:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-10-13 18:09:22,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:09:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:09:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:09:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:09:22,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:09:23,307 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:09:23,307 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-10-13 18:09:23,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:09:23 BoogieIcfgContainer [2019-10-13 18:09:23,309 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:09:23,310 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:09:23,311 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:09:23,314 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:09:23,314 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:09:21" (1/3) ... [2019-10-13 18:09:23,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2891749b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:09:23, skipping insertion in model container [2019-10-13 18:09:23,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:22" (2/3) ... [2019-10-13 18:09:23,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2891749b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:09:23, skipping insertion in model container [2019-10-13 18:09:23,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:09:23" (3/3) ... [2019-10-13 18:09:23,318 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-2.i [2019-10-13 18:09:23,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:09:23,337 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 18:09:23,349 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 18:09:23,377 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:09:23,377 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:09:23,377 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:09:23,377 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:09:23,378 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:09:23,378 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:09:23,378 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:09:23,378 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:09:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states. [2019-10-13 18:09:23,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 18:09:23,424 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:23,425 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:23,427 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:23,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1873878464, now seen corresponding path program 1 times [2019-10-13 18:09:23,443 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:23,443 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191783794] [2019-10-13 18:09:23,443 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:23,444 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:23,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:23,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:23,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191783794] [2019-10-13 18:09:23,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:23,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 18:09:23,612 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843302392] [2019-10-13 18:09:23,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 18:09:23,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:23,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 18:09:23,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:09:23,635 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 3 states. [2019-10-13 18:09:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:23,936 INFO L93 Difference]: Finished difference Result 240 states and 408 transitions. [2019-10-13 18:09:23,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 18:09:23,938 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-13 18:09:23,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:23,953 INFO L225 Difference]: With dead ends: 240 [2019-10-13 18:09:23,953 INFO L226 Difference]: Without dead ends: 118 [2019-10-13 18:09:23,959 INFO L600 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-10-13 18:09:23,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-13 18:09:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 103. [2019-10-13 18:09:24,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-13 18:09:24,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 126 transitions. [2019-10-13 18:09:24,029 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 126 transitions. Word has length 13 [2019-10-13 18:09:24,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:24,029 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 126 transitions. [2019-10-13 18:09:24,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 18:09:24,030 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 126 transitions. [2019-10-13 18:09:24,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 18:09:24,031 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:24,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:24,031 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:24,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:24,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1323314826, now seen corresponding path program 1 times [2019-10-13 18:09:24,032 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:24,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104308183] [2019-10-13 18:09:24,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:24,033 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:24,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:24,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:24,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:24,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104308183] [2019-10-13 18:09:24,148 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:24,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 18:09:24,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037766340] [2019-10-13 18:09:24,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 18:09:24,154 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:24,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 18:09:24,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 18:09:24,155 INFO L87 Difference]: Start difference. First operand 103 states and 126 transitions. Second operand 4 states. [2019-10-13 18:09:24,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:24,464 INFO L93 Difference]: Finished difference Result 206 states and 255 transitions. [2019-10-13 18:09:24,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 18:09:24,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 18:09:24,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:24,466 INFO L225 Difference]: With dead ends: 206 [2019-10-13 18:09:24,466 INFO L226 Difference]: Without dead ends: 115 [2019-10-13 18:09:24,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 18:09:24,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-10-13 18:09:24,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2019-10-13 18:09:24,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-10-13 18:09:24,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2019-10-13 18:09:24,493 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 14 [2019-10-13 18:09:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:24,494 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2019-10-13 18:09:24,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 18:09:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2019-10-13 18:09:24,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 18:09:24,496 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:24,496 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:24,497 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:24,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:24,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1684995551, now seen corresponding path program 1 times [2019-10-13 18:09:24,498 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:24,498 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589738022] [2019-10-13 18:09:24,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:24,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:24,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:24,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589738022] [2019-10-13 18:09:24,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:24,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 18:09:24,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392482811] [2019-10-13 18:09:24,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:09:24,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:24,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:09:24,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:09:24,695 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand 7 states. [2019-10-13 18:09:25,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:25,312 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2019-10-13 18:09:25,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:09:25,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 18:09:25,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:25,315 INFO L225 Difference]: With dead ends: 157 [2019-10-13 18:09:25,316 INFO L226 Difference]: Without dead ends: 152 [2019-10-13 18:09:25,316 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-13 18:09:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-13 18:09:25,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 108. [2019-10-13 18:09:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-10-13 18:09:25,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 131 transitions. [2019-10-13 18:09:25,340 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 131 transitions. Word has length 20 [2019-10-13 18:09:25,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:25,340 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 131 transitions. [2019-10-13 18:09:25,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:09:25,340 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 131 transitions. [2019-10-13 18:09:25,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 18:09:25,341 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:25,341 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:25,342 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:25,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:25,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1145945773, now seen corresponding path program 1 times [2019-10-13 18:09:25,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:25,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223881822] [2019-10-13 18:09:25,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:25,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:25,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:25,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:25,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:25,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223881822] [2019-10-13 18:09:25,464 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:25,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:09:25,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321858805] [2019-10-13 18:09:25,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:09:25,465 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:25,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:09:25,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:09:25,466 INFO L87 Difference]: Start difference. First operand 108 states and 131 transitions. Second operand 6 states. [2019-10-13 18:09:25,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:25,896 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2019-10-13 18:09:25,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 18:09:25,896 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-13 18:09:25,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:25,899 INFO L225 Difference]: With dead ends: 116 [2019-10-13 18:09:25,899 INFO L226 Difference]: Without dead ends: 113 [2019-10-13 18:09:25,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:25,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-13 18:09:25,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2019-10-13 18:09:25,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-10-13 18:09:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 129 transitions. [2019-10-13 18:09:25,922 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 129 transitions. Word has length 27 [2019-10-13 18:09:25,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:25,922 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 129 transitions. [2019-10-13 18:09:25,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:09:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 129 transitions. [2019-10-13 18:09:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-13 18:09:25,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:25,924 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:25,924 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1471361763, now seen corresponding path program 1 times [2019-10-13 18:09:25,925 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:25,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353433611] [2019-10-13 18:09:25,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:25,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:25,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:26,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:26,025 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:26,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353433611] [2019-10-13 18:09:26,026 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:26,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:09:26,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966656492] [2019-10-13 18:09:26,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:09:26,027 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:09:26,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:09:26,028 INFO L87 Difference]: Start difference. First operand 107 states and 129 transitions. Second operand 6 states. [2019-10-13 18:09:26,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:26,473 INFO L93 Difference]: Finished difference Result 115 states and 139 transitions. [2019-10-13 18:09:26,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 18:09:26,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-13 18:09:26,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:26,475 INFO L225 Difference]: With dead ends: 115 [2019-10-13 18:09:26,475 INFO L226 Difference]: Without dead ends: 112 [2019-10-13 18:09:26,476 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-13 18:09:26,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 106. [2019-10-13 18:09:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-13 18:09:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 127 transitions. [2019-10-13 18:09:26,485 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 127 transitions. Word has length 27 [2019-10-13 18:09:26,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:26,486 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 127 transitions. [2019-10-13 18:09:26,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:09:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 127 transitions. [2019-10-13 18:09:26,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 18:09:26,487 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:26,487 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:26,488 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:26,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:26,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1648323131, now seen corresponding path program 1 times [2019-10-13 18:09:26,488 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:26,488 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865448258] [2019-10-13 18:09:26,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:26,489 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:26,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:26,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:26,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:26,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865448258] [2019-10-13 18:09:26,605 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:26,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 18:09:26,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643210140] [2019-10-13 18:09:26,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 18:09:26,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:26,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 18:09:26,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 18:09:26,607 INFO L87 Difference]: Start difference. First operand 106 states and 127 transitions. Second operand 8 states. [2019-10-13 18:09:27,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:27,231 INFO L93 Difference]: Finished difference Result 147 states and 177 transitions. [2019-10-13 18:09:27,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 18:09:27,233 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-13 18:09:27,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:27,236 INFO L225 Difference]: With dead ends: 147 [2019-10-13 18:09:27,236 INFO L226 Difference]: Without dead ends: 144 [2019-10-13 18:09:27,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-13 18:09:27,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 112. [2019-10-13 18:09:27,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-10-13 18:09:27,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2019-10-13 18:09:27,248 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 30 [2019-10-13 18:09:27,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:27,248 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2019-10-13 18:09:27,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 18:09:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2019-10-13 18:09:27,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-13 18:09:27,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:27,250 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:27,250 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:27,250 INFO L82 PathProgramCache]: Analyzing trace with hash 861386650, now seen corresponding path program 1 times [2019-10-13 18:09:27,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:27,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356083605] [2019-10-13 18:09:27,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:27,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:27,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:27,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:27,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356083605] [2019-10-13 18:09:27,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:27,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 18:09:27,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939552454] [2019-10-13 18:09:27,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 18:09:27,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:27,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 18:09:27,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 18:09:27,329 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand 8 states. [2019-10-13 18:09:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:27,959 INFO L93 Difference]: Finished difference Result 146 states and 175 transitions. [2019-10-13 18:09:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 18:09:27,960 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-10-13 18:09:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:27,962 INFO L225 Difference]: With dead ends: 146 [2019-10-13 18:09:27,962 INFO L226 Difference]: Without dead ends: 143 [2019-10-13 18:09:27,963 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:27,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-10-13 18:09:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 118. [2019-10-13 18:09:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-10-13 18:09:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 139 transitions. [2019-10-13 18:09:27,973 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 139 transitions. Word has length 30 [2019-10-13 18:09:27,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:27,974 INFO L462 AbstractCegarLoop]: Abstraction has 118 states and 139 transitions. [2019-10-13 18:09:27,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 18:09:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 139 transitions. [2019-10-13 18:09:27,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 18:09:27,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:27,975 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:27,975 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:27,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:27,976 INFO L82 PathProgramCache]: Analyzing trace with hash 671486784, now seen corresponding path program 1 times [2019-10-13 18:09:27,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:27,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655561646] [2019-10-13 18:09:27,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:27,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:27,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:28,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:28,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:28,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655561646] [2019-10-13 18:09:28,140 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:28,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 18:09:28,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704687892] [2019-10-13 18:09:28,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 18:09:28,141 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:28,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 18:09:28,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:28,142 INFO L87 Difference]: Start difference. First operand 118 states and 139 transitions. Second operand 9 states. [2019-10-13 18:09:29,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:29,081 INFO L93 Difference]: Finished difference Result 150 states and 181 transitions. [2019-10-13 18:09:29,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:09:29,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-10-13 18:09:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:29,084 INFO L225 Difference]: With dead ends: 150 [2019-10-13 18:09:29,084 INFO L226 Difference]: Without dead ends: 147 [2019-10-13 18:09:29,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-13 18:09:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-10-13 18:09:29,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 121. [2019-10-13 18:09:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2019-10-13 18:09:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2019-10-13 18:09:29,095 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 33 [2019-10-13 18:09:29,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:29,095 INFO L462 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2019-10-13 18:09:29,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 18:09:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2019-10-13 18:09:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-13 18:09:29,097 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:29,097 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:29,097 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:29,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:29,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1082082582, now seen corresponding path program 1 times [2019-10-13 18:09:29,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:29,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852184319] [2019-10-13 18:09:29,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:29,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:29,098 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:29,230 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:29,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852184319] [2019-10-13 18:09:29,231 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:29,231 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 18:09:29,231 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673342976] [2019-10-13 18:09:29,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 18:09:29,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:29,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 18:09:29,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:29,233 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand 9 states. [2019-10-13 18:09:30,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:30,175 INFO L93 Difference]: Finished difference Result 149 states and 179 transitions. [2019-10-13 18:09:30,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:09:30,175 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-10-13 18:09:30,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:30,177 INFO L225 Difference]: With dead ends: 149 [2019-10-13 18:09:30,177 INFO L226 Difference]: Without dead ends: 146 [2019-10-13 18:09:30,177 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-13 18:09:30,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-10-13 18:09:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2019-10-13 18:09:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-13 18:09:30,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 145 transitions. [2019-10-13 18:09:30,187 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 145 transitions. Word has length 33 [2019-10-13 18:09:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:30,187 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 145 transitions. [2019-10-13 18:09:30,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 18:09:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 145 transitions. [2019-10-13 18:09:30,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 18:09:30,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:30,189 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:30,189 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:30,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:30,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1572887273, now seen corresponding path program 1 times [2019-10-13 18:09:30,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:30,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338638779] [2019-10-13 18:09:30,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:30,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:30,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:30,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:30,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:30,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338638779] [2019-10-13 18:09:30,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:30,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:09:30,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625728193] [2019-10-13 18:09:30,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:09:30,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:09:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:09:30,293 INFO L87 Difference]: Start difference. First operand 124 states and 145 transitions. Second operand 6 states. [2019-10-13 18:09:30,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:30,733 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2019-10-13 18:09:30,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 18:09:30,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 38 [2019-10-13 18:09:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:30,735 INFO L225 Difference]: With dead ends: 132 [2019-10-13 18:09:30,735 INFO L226 Difference]: Without dead ends: 128 [2019-10-13 18:09:30,738 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:30,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-13 18:09:30,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2019-10-13 18:09:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-13 18:09:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2019-10-13 18:09:30,750 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 38 [2019-10-13 18:09:30,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:30,750 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2019-10-13 18:09:30,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:09:30,751 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2019-10-13 18:09:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-13 18:09:30,757 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:30,757 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:30,757 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:30,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 235623500, now seen corresponding path program 1 times [2019-10-13 18:09:30,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:30,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432329848] [2019-10-13 18:09:30,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:30,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:30,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:30,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432329848] [2019-10-13 18:09:30,873 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:30,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 18:09:30,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577297585] [2019-10-13 18:09:30,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 18:09:30,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:30,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 18:09:30,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 18:09:30,874 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand 8 states. [2019-10-13 18:09:31,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:31,381 INFO L93 Difference]: Finished difference Result 158 states and 186 transitions. [2019-10-13 18:09:31,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:09:31,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2019-10-13 18:09:31,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:31,384 INFO L225 Difference]: With dead ends: 158 [2019-10-13 18:09:31,384 INFO L226 Difference]: Without dead ends: 155 [2019-10-13 18:09:31,385 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-13 18:09:31,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 127. [2019-10-13 18:09:31,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-10-13 18:09:31,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2019-10-13 18:09:31,398 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 41 [2019-10-13 18:09:31,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:31,398 INFO L462 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2019-10-13 18:09:31,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 18:09:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2019-10-13 18:09:31,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 18:09:31,403 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:31,403 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:31,404 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:31,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:31,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1351973035, now seen corresponding path program 1 times [2019-10-13 18:09:31,404 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:31,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941087061] [2019-10-13 18:09:31,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:31,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:31,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:31,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:31,728 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:31,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941087061] [2019-10-13 18:09:31,729 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189323050] [2019-10-13 18:09:31,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:31,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:31,871 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 18:09:31,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:31,990 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 14 treesize of output 15 [2019-10-13 18:09:31,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:32,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:32,008 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 14 treesize of output 15 [2019-10-13 18:09:32,009 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:32,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:32,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:32,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2019-10-13 18:09:32,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:32,112 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:32,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:32,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:32,129 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:32,133 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:32,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:32,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 18:09:32,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:32,154 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:32,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-13 18:09:32,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813105520] [2019-10-13 18:09:32,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:09:32,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:32,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:09:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:32,156 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand 12 states. [2019-10-13 18:09:33,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:33,380 INFO L93 Difference]: Finished difference Result 271 states and 323 transitions. [2019-10-13 18:09:33,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 18:09:33,380 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-10-13 18:09:33,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:33,382 INFO L225 Difference]: With dead ends: 271 [2019-10-13 18:09:33,383 INFO L226 Difference]: Without dead ends: 268 [2019-10-13 18:09:33,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:09:33,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-10-13 18:09:33,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 195. [2019-10-13 18:09:33,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2019-10-13 18:09:33,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 223 transitions. [2019-10-13 18:09:33,401 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 223 transitions. Word has length 44 [2019-10-13 18:09:33,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:33,401 INFO L462 AbstractCegarLoop]: Abstraction has 195 states and 223 transitions. [2019-10-13 18:09:33,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:09:33,401 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 223 transitions. [2019-10-13 18:09:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-13 18:09:33,402 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:33,402 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:33,608 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:33,608 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:33,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1255057270, now seen corresponding path program 1 times [2019-10-13 18:09:33,609 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:33,609 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757377719] [2019-10-13 18:09:33,609 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:33,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:33,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:33,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:33,868 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757377719] [2019-10-13 18:09:33,869 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702255244] [2019-10-13 18:09:33,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:33,989 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-13 18:09:33,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:34,024 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 14 treesize of output 15 [2019-10-13 18:09:34,025 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:34,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:34,038 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 14 treesize of output 15 [2019-10-13 18:09:34,038 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:34,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:34,049 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:34,049 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:18 [2019-10-13 18:09:34,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:34,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:34,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:34,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:34,077 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:34,081 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:34,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:34,081 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 18:09:34,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:34,099 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:34,100 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 12 [2019-10-13 18:09:34,100 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082071104] [2019-10-13 18:09:34,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:09:34,100 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:34,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:09:34,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:34,101 INFO L87 Difference]: Start difference. First operand 195 states and 223 transitions. Second operand 12 states. [2019-10-13 18:09:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:34,854 INFO L93 Difference]: Finished difference Result 269 states and 315 transitions. [2019-10-13 18:09:34,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:09:34,855 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2019-10-13 18:09:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:34,857 INFO L225 Difference]: With dead ends: 269 [2019-10-13 18:09:34,857 INFO L226 Difference]: Without dead ends: 170 [2019-10-13 18:09:34,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-13 18:09:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-13 18:09:34,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 161. [2019-10-13 18:09:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2019-10-13 18:09:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 183 transitions. [2019-10-13 18:09:34,870 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 183 transitions. Word has length 44 [2019-10-13 18:09:34,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:34,870 INFO L462 AbstractCegarLoop]: Abstraction has 161 states and 183 transitions. [2019-10-13 18:09:34,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:09:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 183 transitions. [2019-10-13 18:09:34,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 18:09:34,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:34,871 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:35,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:35,076 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1691394343, now seen corresponding path program 1 times [2019-10-13 18:09:35,077 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:35,077 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840968256] [2019-10-13 18:09:35,077 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:35,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:35,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:35,291 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840968256] [2019-10-13 18:09:35,291 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:35,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 18:09:35,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011019180] [2019-10-13 18:09:35,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 18:09:35,292 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:35,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 18:09:35,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-13 18:09:35,293 INFO L87 Difference]: Start difference. First operand 161 states and 183 transitions. Second operand 11 states. [2019-10-13 18:09:36,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:36,099 INFO L93 Difference]: Finished difference Result 196 states and 226 transitions. [2019-10-13 18:09:36,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:09:36,099 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2019-10-13 18:09:36,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:36,101 INFO L225 Difference]: With dead ends: 196 [2019-10-13 18:09:36,101 INFO L226 Difference]: Without dead ends: 193 [2019-10-13 18:09:36,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2019-10-13 18:09:36,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-13 18:09:36,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 175. [2019-10-13 18:09:36,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-10-13 18:09:36,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 199 transitions. [2019-10-13 18:09:36,116 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 199 transitions. Word has length 47 [2019-10-13 18:09:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:36,116 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 199 transitions. [2019-10-13 18:09:36,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 18:09:36,116 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 199 transitions. [2019-10-13 18:09:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 18:09:36,117 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:36,117 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:36,118 INFO L410 AbstractCegarLoop]: === Iteration 15 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:36,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:36,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1821749989, now seen corresponding path program 1 times [2019-10-13 18:09:36,118 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:36,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432433951] [2019-10-13 18:09:36,118 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:36,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:36,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:36,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:36,222 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:36,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432433951] [2019-10-13 18:09:36,222 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:36,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 18:09:36,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313540146] [2019-10-13 18:09:36,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 18:09:36,223 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:36,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 18:09:36,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:36,224 INFO L87 Difference]: Start difference. First operand 175 states and 199 transitions. Second operand 9 states. [2019-10-13 18:09:36,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:36,873 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2019-10-13 18:09:36,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:09:36,873 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-10-13 18:09:36,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:36,875 INFO L225 Difference]: With dead ends: 237 [2019-10-13 18:09:36,875 INFO L226 Difference]: Without dead ends: 187 [2019-10-13 18:09:36,876 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-13 18:09:36,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-10-13 18:09:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2019-10-13 18:09:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-10-13 18:09:36,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 206 transitions. [2019-10-13 18:09:36,890 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 206 transitions. Word has length 50 [2019-10-13 18:09:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:36,891 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 206 transitions. [2019-10-13 18:09:36,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 18:09:36,891 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 206 transitions. [2019-10-13 18:09:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 18:09:36,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:36,892 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:36,892 INFO L410 AbstractCegarLoop]: === Iteration 16 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:36,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:36,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1200260978, now seen corresponding path program 1 times [2019-10-13 18:09:36,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:36,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856301943] [2019-10-13 18:09:36,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:36,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:36,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:37,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:37,083 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856301943] [2019-10-13 18:09:37,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:37,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-13 18:09:37,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629858880] [2019-10-13 18:09:37,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-13 18:09:37,085 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:37,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-13 18:09:37,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:09:37,086 INFO L87 Difference]: Start difference. First operand 180 states and 206 transitions. Second operand 13 states. [2019-10-13 18:09:38,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:38,167 INFO L93 Difference]: Finished difference Result 220 states and 261 transitions. [2019-10-13 18:09:38,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 18:09:38,168 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 51 [2019-10-13 18:09:38,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:38,169 INFO L225 Difference]: With dead ends: 220 [2019-10-13 18:09:38,170 INFO L226 Difference]: Without dead ends: 217 [2019-10-13 18:09:38,170 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2019-10-13 18:09:38,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2019-10-13 18:09:38,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 191. [2019-10-13 18:09:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-10-13 18:09:38,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2019-10-13 18:09:38,187 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 51 [2019-10-13 18:09:38,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:38,187 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2019-10-13 18:09:38,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-13 18:09:38,188 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2019-10-13 18:09:38,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 18:09:38,188 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:38,189 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:38,189 INFO L410 AbstractCegarLoop]: === Iteration 17 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:38,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:38,189 INFO L82 PathProgramCache]: Analyzing trace with hash 629786452, now seen corresponding path program 2 times [2019-10-13 18:09:38,190 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:38,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628968881] [2019-10-13 18:09:38,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:38,190 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:38,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:38,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:38,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:38,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628968881] [2019-10-13 18:09:38,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169296885] [2019-10-13 18:09:38,499 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:38,614 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-13 18:09:38,615 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:09:38,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-13 18:09:38,618 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:38,759 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-10-13 18:09:38,759 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:38,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:38,769 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-10-13 18:09:38,769 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:38,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:38,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:38,780 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-10-13 18:09:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 18:09:38,801 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 18:09:38,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 19 [2019-10-13 18:09:38,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293537060] [2019-10-13 18:09:38,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:09:38,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:38,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:09:38,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-13 18:09:38,802 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand 7 states. [2019-10-13 18:09:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:39,124 INFO L93 Difference]: Finished difference Result 193 states and 226 transitions. [2019-10-13 18:09:39,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:09:39,126 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-10-13 18:09:39,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:39,127 INFO L225 Difference]: With dead ends: 193 [2019-10-13 18:09:39,127 INFO L226 Difference]: Without dead ends: 190 [2019-10-13 18:09:39,128 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-10-13 18:09:39,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2019-10-13 18:09:39,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 182. [2019-10-13 18:09:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-13 18:09:39,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 213 transitions. [2019-10-13 18:09:39,152 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 213 transitions. Word has length 50 [2019-10-13 18:09:39,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:39,153 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 213 transitions. [2019-10-13 18:09:39,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:09:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2019-10-13 18:09:39,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 18:09:39,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:39,155 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:39,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:39,359 INFO L410 AbstractCegarLoop]: === Iteration 18 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:39,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:39,361 INFO L82 PathProgramCache]: Analyzing trace with hash 532870687, now seen corresponding path program 2 times [2019-10-13 18:09:39,361 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:39,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185814431] [2019-10-13 18:09:39,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:39,362 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:39,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:39,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:39,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185814431] [2019-10-13 18:09:39,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409651071] [2019-10-13 18:09:39,903 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:40,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:09:40,026 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:09:40,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-13 18:09:40,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:40,087 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:40,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,095 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,095 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:13 [2019-10-13 18:09:40,136 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 14 treesize of output 15 [2019-10-13 18:09:40,137 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,147 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,148 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:27, output treesize:17 [2019-10-13 18:09:40,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:09:40,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,167 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:19 [2019-10-13 18:09:40,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:40,241 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-10-13 18:09:40,242 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,263 INFO L567 ElimStorePlain]: treesize reduction 4, result has 87.9 percent of original size [2019-10-13 18:09:40,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,264 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:29 [2019-10-13 18:09:40,305 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_56|], 3=[|v_#memory_$Pointer$.base_58|]} [2019-10-13 18:09:40,309 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 14 treesize of output 15 [2019-10-13 18:09:40,309 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,324 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,361 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,362 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 3 case distinctions, treesize of input 30 treesize of output 76 [2019-10-13 18:09:40,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,366 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,422 INFO L567 ElimStorePlain]: treesize reduction 41, result has 59.4 percent of original size [2019-10-13 18:09:40,423 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,424 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:69 [2019-10-13 18:09:40,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,592 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 72 treesize of output 60 [2019-10-13 18:09:40,593 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,600 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 68 treesize of output 56 [2019-10-13 18:09:40,601 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,661 INFO L567 ElimStorePlain]: treesize reduction 12, result has 88.6 percent of original size [2019-10-13 18:09:40,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-13 18:09:40,663 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:93 [2019-10-13 18:09:40,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,770 INFO L392 ElimStorePlain]: Different costs {1=[|#memory_$Pointer$.base|], 3=[v_prenex_3]} [2019-10-13 18:09:40,793 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 30 [2019-10-13 18:09:40,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,812 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:40,828 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 45 [2019-10-13 18:09:40,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:40,833 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,840 INFO L567 ElimStorePlain]: treesize reduction 10, result has 28.6 percent of original size [2019-10-13 18:09:40,840 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:40,840 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:95, output treesize:4 [2019-10-13 18:09:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:40,866 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:40,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 25 [2019-10-13 18:09:40,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575870171] [2019-10-13 18:09:40,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 18:09:40,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:40,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 18:09:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=523, Unknown=0, NotChecked=0, Total=600 [2019-10-13 18:09:40,868 INFO L87 Difference]: Start difference. First operand 182 states and 213 transitions. Second operand 25 states. [2019-10-13 18:09:41,872 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-10-13 18:09:44,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:44,078 INFO L93 Difference]: Finished difference Result 237 states and 288 transitions. [2019-10-13 18:09:44,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 18:09:44,078 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-10-13 18:09:44,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:44,081 INFO L225 Difference]: With dead ends: 237 [2019-10-13 18:09:44,081 INFO L226 Difference]: Without dead ends: 234 [2019-10-13 18:09:44,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 18:09:44,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2019-10-13 18:09:44,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 193. [2019-10-13 18:09:44,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-13 18:09:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 225 transitions. [2019-10-13 18:09:44,109 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 225 transitions. Word has length 50 [2019-10-13 18:09:44,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:44,110 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 225 transitions. [2019-10-13 18:09:44,110 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 18:09:44,110 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 225 transitions. [2019-10-13 18:09:44,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 18:09:44,111 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:44,111 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:44,323 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:44,324 INFO L410 AbstractCegarLoop]: === Iteration 19 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:44,324 INFO L82 PathProgramCache]: Analyzing trace with hash -254065794, now seen corresponding path program 1 times [2019-10-13 18:09:44,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:44,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685369131] [2019-10-13 18:09:44,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:44,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:44,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:44,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685369131] [2019-10-13 18:09:44,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036866616] [2019-10-13 18:09:44,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:45,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-13 18:09:45,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:45,118 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:45,118 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,126 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:09:45,159 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 14 treesize of output 15 [2019-10-13 18:09:45,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,178 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 14 treesize of output 15 [2019-10-13 18:09:45,179 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,200 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,201 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:23 [2019-10-13 18:09:45,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:09:45,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,311 INFO L567 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2019-10-13 18:09:45,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:32 [2019-10-13 18:09:45,374 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,375 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 18:09:45,375 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:45,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-10-13 18:09:45,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,439 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,444 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:45,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-10-13 18:09:45,445 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,465 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:47 [2019-10-13 18:09:45,524 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 29 treesize of output 35 [2019-10-13 18:09:45,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,557 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 29 treesize of output 35 [2019-10-13 18:09:45,558 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:45,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:45,595 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:91 [2019-10-13 18:09:45,869 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:45,870 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 18:09:45,967 INFO L341 Elim1Store]: treesize reduction 8, result has 91.1 percent of original size [2019-10-13 18:09:45,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 115 treesize of output 140 [2019-10-13 18:09:45,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:45,986 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:46,046 INFO L567 ElimStorePlain]: treesize reduction 62, result has 46.6 percent of original size [2019-10-13 18:09:46,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:46,054 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 29 [2019-10-13 18:09:46,055 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:46,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:46,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:46,070 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:7 [2019-10-13 18:09:46,114 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:46,114 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:46,114 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 25 [2019-10-13 18:09:46,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656135783] [2019-10-13 18:09:46,115 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-13 18:09:46,115 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:46,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-13 18:09:46,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2019-10-13 18:09:46,116 INFO L87 Difference]: Start difference. First operand 193 states and 225 transitions. Second operand 25 states. [2019-10-13 18:09:47,392 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-10-13 18:09:47,753 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-10-13 18:09:50,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:50,945 INFO L93 Difference]: Finished difference Result 395 states and 482 transitions. [2019-10-13 18:09:50,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 18:09:50,945 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 50 [2019-10-13 18:09:50,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:50,948 INFO L225 Difference]: With dead ends: 395 [2019-10-13 18:09:50,948 INFO L226 Difference]: Without dead ends: 294 [2019-10-13 18:09:50,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=222, Invalid=1758, Unknown=0, NotChecked=0, Total=1980 [2019-10-13 18:09:50,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2019-10-13 18:09:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 253. [2019-10-13 18:09:50,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-13 18:09:50,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 288 transitions. [2019-10-13 18:09:50,971 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 288 transitions. Word has length 50 [2019-10-13 18:09:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:50,972 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 288 transitions. [2019-10-13 18:09:50,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-13 18:09:50,972 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 288 transitions. [2019-10-13 18:09:50,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 18:09:50,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:50,973 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:51,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:51,177 INFO L410 AbstractCegarLoop]: === Iteration 20 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:51,177 INFO L82 PathProgramCache]: Analyzing trace with hash -596228507, now seen corresponding path program 1 times [2019-10-13 18:09:51,177 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:51,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507474361] [2019-10-13 18:09:51,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:51,178 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:51,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:51,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:51,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:51,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-13 18:09:51,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507474361] [2019-10-13 18:09:51,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:51,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 18:09:51,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789079481] [2019-10-13 18:09:51,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 18:09:51,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:51,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 18:09:51,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 18:09:51,251 INFO L87 Difference]: Start difference. First operand 253 states and 288 transitions. Second operand 6 states. [2019-10-13 18:09:51,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:51,726 INFO L93 Difference]: Finished difference Result 258 states and 294 transitions. [2019-10-13 18:09:51,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 18:09:51,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-13 18:09:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:51,728 INFO L225 Difference]: With dead ends: 258 [2019-10-13 18:09:51,729 INFO L226 Difference]: Without dead ends: 239 [2019-10-13 18:09:51,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:51,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2019-10-13 18:09:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2019-10-13 18:09:51,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2019-10-13 18:09:51,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 268 transitions. [2019-10-13 18:09:51,759 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 268 transitions. Word has length 53 [2019-10-13 18:09:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:51,759 INFO L462 AbstractCegarLoop]: Abstraction has 236 states and 268 transitions. [2019-10-13 18:09:51,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 18:09:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 268 transitions. [2019-10-13 18:09:51,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 18:09:51,765 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:51,765 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:51,765 INFO L410 AbstractCegarLoop]: === Iteration 21 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash 389696732, now seen corresponding path program 1 times [2019-10-13 18:09:51,766 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:51,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98921569] [2019-10-13 18:09:51,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:51,766 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:51,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:51,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:52,273 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2019-10-13 18:09:52,729 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 34 [2019-10-13 18:09:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:53,130 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:53,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98921569] [2019-10-13 18:09:53,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781660235] [2019-10-13 18:09:53,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:53,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:53,281 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-13 18:09:53,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:53,291 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:53,291 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 18:09:53,316 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,317 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:09:53,317 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,361 INFO L567 ElimStorePlain]: treesize reduction 14, result has 82.3 percent of original size [2019-10-13 18:09:53,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:53,369 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 22 treesize of output 7 [2019-10-13 18:09:53,369 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,388 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:53,390 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 22 treesize of output 7 [2019-10-13 18:09:53,390 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,405 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:67, output treesize:35 [2019-10-13 18:09:53,424 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 22 treesize of output 25 [2019-10-13 18:09:53,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,456 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 22 treesize of output 25 [2019-10-13 18:09:53,457 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,476 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,477 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:55 [2019-10-13 18:09:53,576 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,577 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 89 [2019-10-13 18:09:53,578 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,652 INFO L567 ElimStorePlain]: treesize reduction 40, result has 65.2 percent of original size [2019-10-13 18:09:53,653 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,653 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:75 [2019-10-13 18:09:53,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,760 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 41 [2019-10-13 18:09:53,761 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,806 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:53,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-10-13 18:09:53,844 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,883 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:53,897 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:53,898 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 71 [2019-10-13 18:09:53,898 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,965 INFO L567 ElimStorePlain]: treesize reduction 44, result has 66.9 percent of original size [2019-10-13 18:09:53,966 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:53,966 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:127, output treesize:89 [2019-10-13 18:09:54,064 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:54,065 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 96 [2019-10-13 18:09:54,066 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:54,152 INFO L567 ElimStorePlain]: treesize reduction 48, result has 69.0 percent of original size [2019-10-13 18:09:54,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:54,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 49 [2019-10-13 18:09:54,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:54,203 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:54,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:54,204 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:145 [2019-10-13 18:09:54,856 INFO L392 ElimStorePlain]: Different costs {28=[|#memory_$Pointer$.offset|], 42=[|#memory_$Pointer$.base|]} [2019-10-13 18:09:54,859 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:54,860 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:54,920 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:54,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 7 case distinctions, treesize of input 131 treesize of output 164 [2019-10-13 18:09:54,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:54,981 INFO L567 ElimStorePlain]: treesize reduction 56, result has 66.7 percent of original size [2019-10-13 18:09:55,015 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:55,016 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 15 case distinctions, treesize of input 109 treesize of output 98 [2019-10-13 18:09:55,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:55,027 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:55,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:55,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:55,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:213, output treesize:7 [2019-10-13 18:09:55,066 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:55,066 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:55,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-10-13 18:09:55,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090161980] [2019-10-13 18:09:55,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 18:09:55,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:55,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 18:09:55,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=619, Unknown=0, NotChecked=0, Total=702 [2019-10-13 18:09:55,068 INFO L87 Difference]: Start difference. First operand 236 states and 268 transitions. Second operand 27 states. [2019-10-13 18:09:55,355 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-10-13 18:09:55,787 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 85 [2019-10-13 18:09:56,240 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-13 18:09:56,491 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-10-13 18:09:57,238 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-13 18:09:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:59,244 INFO L93 Difference]: Finished difference Result 268 states and 316 transitions. [2019-10-13 18:09:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 18:09:59,244 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 53 [2019-10-13 18:09:59,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:59,246 INFO L225 Difference]: With dead ends: 268 [2019-10-13 18:09:59,246 INFO L226 Difference]: Without dead ends: 265 [2019-10-13 18:09:59,247 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 47 SyntacticMatches, 4 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 285 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=218, Invalid=1342, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 18:09:59,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-13 18:09:59,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 239. [2019-10-13 18:09:59,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-13 18:09:59,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2019-10-13 18:09:59,272 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 53 [2019-10-13 18:09:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:59,272 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2019-10-13 18:09:59,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 18:09:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2019-10-13 18:09:59,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-13 18:09:59,274 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:59,274 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:59,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:59,478 INFO L410 AbstractCegarLoop]: === Iteration 22 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:59,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:59,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1372178843, now seen corresponding path program 1 times [2019-10-13 18:09:59,479 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:59,479 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503924039] [2019-10-13 18:09:59,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:59,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:59,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:59,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:59,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:59,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:59,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503924039] [2019-10-13 18:09:59,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [523089455] [2019-10-13 18:09:59,918 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-10-13 18:10:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:10:00,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 61 conjunts are in the unsatisfiable core [2019-10-13 18:10:00,104 INFO L279 TraceCheckSpWp]: Computing forward predicates...