/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:15:13,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:15:13,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:15:13,359 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:15:13,359 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:15:13,360 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:15:13,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:15:13,363 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:15:13,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:15:13,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:15:13,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:15:13,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:15:13,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:15:13,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:15:13,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:15:13,372 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:15:13,373 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:15:13,375 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:15:13,377 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:15:13,379 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:15:13,383 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:15:13,384 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:15:13,388 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:15:13,389 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:15:13,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:15:13,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:15:13,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:15:13,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:15:13,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:15:13,395 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:15:13,395 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:15:13,396 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:15:13,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:15:13,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:15:13,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:15:13,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:15:13,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:15:13,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:15:13,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:15:13,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:15:13,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:15:13,405 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:15:13,418 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:15:13,418 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:15:13,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:15:13,420 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:15:13,420 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:15:13,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:15:13,420 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:15:13,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:15:13,421 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:15:13,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:15:13,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:15:13,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:15:13,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:15:13,422 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:15:13,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:15:13,422 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:15:13,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:15:13,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:15:13,422 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:15:13,423 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:15:13,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:15:13,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:13,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:15:13,423 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:15:13,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:15:13,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:15:13,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:15:13,424 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:15:13,424 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:15:13,699 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:15:13,716 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:15:13,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:15:13,720 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:15:13,720 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:15:13,721 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-1.i [2019-11-06 21:15:13,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e196441a9/c2e670a0be8e4d1b8755aebe4f95b9e8/FLAG103539378 [2019-11-06 21:15:14,333 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:15:14,334 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-1.i [2019-11-06 21:15:14,358 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e196441a9/c2e670a0be8e4d1b8755aebe4f95b9e8/FLAG103539378 [2019-11-06 21:15:14,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e196441a9/c2e670a0be8e4d1b8755aebe4f95b9e8 [2019-11-06 21:15:14,639 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:15:14,641 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:15:14,642 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:14,642 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:15:14,645 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:15:14,646 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:14" (1/1) ... [2019-11-06 21:15:14,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7bee3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:14, skipping insertion in model container [2019-11-06 21:15:14,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:14" (1/1) ... [2019-11-06 21:15:14,656 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:15:14,707 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:15:15,127 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:15,137 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:15:15,191 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:15,252 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:15:15,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15 WrapperNode [2019-11-06 21:15:15,253 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:15,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:15:15,254 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:15:15,254 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:15:15,264 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... [2019-11-06 21:15:15,265 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... [2019-11-06 21:15:15,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... [2019-11-06 21:15:15,280 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... [2019-11-06 21:15:15,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... [2019-11-06 21:15:15,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... [2019-11-06 21:15:15,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... [2019-11-06 21:15:15,310 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:15:15,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:15:15,311 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:15:15,311 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:15:15,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:15,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:15:15,363 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:15:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:15:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:15:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:15:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:15:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:15:15,364 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:15:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:15:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:15:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:15:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:15:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:15:15,365 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:15:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:15:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:15:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:15:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:15:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:15:15,366 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:15:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:15:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:15:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-06 21:15:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-06 21:15:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-06 21:15:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:15:15,367 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:15:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:15:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:15:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:15:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:15:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:15:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:15:15,368 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:15:15,369 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:15:15,370 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:15:15,371 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:15:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:15:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:15:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:15:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:15:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:15:15,372 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:15:15,373 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:15:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:15:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:15:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:15:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:15:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:15:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:15:15,374 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:15:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:15:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:15:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:15:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:15:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:15:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:15:15,375 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:15:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:15:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:15:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:15:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:15:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:15:15,376 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:15:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:15:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:15:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:15:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:15:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:15:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:15:15,377 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:15:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:15:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:15:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:15:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:15:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:15:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:15:15,378 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:15:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:15:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:15:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:15:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:15:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:15:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:15:15,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:15:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:15:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:15:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:15:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:15:15,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:15:15,712 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:15:15,893 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:15:15,894 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-06 21:15:15,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:15 BoogieIcfgContainer [2019-11-06 21:15:15,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:15:15,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:15:15,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:15:15,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:15:15,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:14" (1/3) ... [2019-11-06 21:15:15,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d5ea37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:15, skipping insertion in model container [2019-11-06 21:15:15,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:15" (2/3) ... [2019-11-06 21:15:15,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d5ea37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:15, skipping insertion in model container [2019-11-06 21:15:15,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:15" (3/3) ... [2019-11-06 21:15:15,903 INFO L109 eAbstractionObserver]: Analyzing ICFG list-1.i [2019-11-06 21:15:15,911 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:15:15,918 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:15:15,930 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:15:15,954 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:15:15,954 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:15:15,954 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:15:15,954 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:15:15,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:15:15,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:15:15,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:15:15,955 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:15:15,970 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-11-06 21:15:15,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-06 21:15:15,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:15,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:15,979 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:15,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:15,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1613857984, now seen corresponding path program 1 times [2019-11-06 21:15:15,995 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:15,995 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500368198] [2019-11-06 21:15:15,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:16,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:16,168 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500368198] [2019-11-06 21:15:16,169 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:16,170 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:15:16,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703720009] [2019-11-06 21:15:16,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:15:16,182 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:16,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:15:16,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:15:16,197 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-11-06 21:15:16,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:16,336 INFO L93 Difference]: Finished difference Result 56 states and 74 transitions. [2019-11-06 21:15:16,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:15:16,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-06 21:15:16,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:16,347 INFO L225 Difference]: With dead ends: 56 [2019-11-06 21:15:16,348 INFO L226 Difference]: Without dead ends: 25 [2019-11-06 21:15:16,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:15:16,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-06 21:15:16,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-06 21:15:16,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-06 21:15:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-06 21:15:16,388 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2019-11-06 21:15:16,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:16,389 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-06 21:15:16,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:15:16,389 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-11-06 21:15:16,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:15:16,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:16,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:16,391 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:16,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:16,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1642379272, now seen corresponding path program 1 times [2019-11-06 21:15:16,392 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:16,392 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784617630] [2019-11-06 21:15:16,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:16,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:16,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:16,578 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784617630] [2019-11-06 21:15:16,579 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:16,579 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:15:16,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526205428] [2019-11-06 21:15:16,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:15:16,584 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:16,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:15:16,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:15:16,585 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 6 states. [2019-11-06 21:15:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:16,762 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2019-11-06 21:15:16,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:16,763 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-06 21:15:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:16,766 INFO L225 Difference]: With dead ends: 50 [2019-11-06 21:15:16,766 INFO L226 Difference]: Without dead ends: 46 [2019-11-06 21:15:16,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:15:16,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-06 21:15:16,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 34. [2019-11-06 21:15:16,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-06 21:15:16,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2019-11-06 21:15:16,787 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 20 [2019-11-06 21:15:16,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:16,787 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2019-11-06 21:15:16,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:15:16,788 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2019-11-06 21:15:16,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:15:16,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:16,792 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:16,792 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:16,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:16,793 INFO L82 PathProgramCache]: Analyzing trace with hash -2024806125, now seen corresponding path program 1 times [2019-11-06 21:15:16,793 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:16,793 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815305935] [2019-11-06 21:15:16,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:16,953 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:16,954 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815305935] [2019-11-06 21:15:16,954 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:16,954 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:15:16,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534686593] [2019-11-06 21:15:16,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:15:16,956 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:16,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:15:16,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:15:16,956 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 6 states. [2019-11-06 21:15:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:17,119 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-06 21:15:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:17,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-06 21:15:17,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:17,122 INFO L225 Difference]: With dead ends: 52 [2019-11-06 21:15:17,122 INFO L226 Difference]: Without dead ends: 44 [2019-11-06 21:15:17,122 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:15:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-06 21:15:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2019-11-06 21:15:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 21:15:17,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2019-11-06 21:15:17,136 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 22 [2019-11-06 21:15:17,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:17,136 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2019-11-06 21:15:17,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:15:17,137 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2019-11-06 21:15:17,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:15:17,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:17,140 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:17,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:17,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1000103149, now seen corresponding path program 1 times [2019-11-06 21:15:17,142 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:17,142 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510145685] [2019-11-06 21:15:17,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:17,227 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510145685] [2019-11-06 21:15:17,228 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:17,228 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:15:17,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973577070] [2019-11-06 21:15:17,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:15:17,229 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:17,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:15:17,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:15:17,229 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 6 states. [2019-11-06 21:15:17,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:17,365 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-06 21:15:17,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:15:17,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-11-06 21:15:17,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:17,367 INFO L225 Difference]: With dead ends: 52 [2019-11-06 21:15:17,367 INFO L226 Difference]: Without dead ends: 41 [2019-11-06 21:15:17,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:15:17,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-06 21:15:17,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-11-06 21:15:17,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 21:15:17,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-11-06 21:15:17,373 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 22 [2019-11-06 21:15:17,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:17,374 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-11-06 21:15:17,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:15:17,374 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-11-06 21:15:17,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:15:17,375 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:17,375 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:17,375 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:17,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:17,376 INFO L82 PathProgramCache]: Analyzing trace with hash 422878047, now seen corresponding path program 1 times [2019-11-06 21:15:17,376 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:17,376 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50804660] [2019-11-06 21:15:17,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:17,542 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50804660] [2019-11-06 21:15:17,542 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688294945] [2019-11-06 21:15:17,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:17,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:17,659 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-06 21:15:17,667 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:17,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:17,728 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,731 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:17,763 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,763 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:17,764 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,796 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 11 treesize of output 7 [2019-11-06 21:15:17,796 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,822 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,822 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,822 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-06 21:15:17,846 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:17,847 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:17,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,856 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,856 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-06 21:15:17,890 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:17,891 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,898 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,899 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:17,899 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-06 21:15:17,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:17,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:17,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:17,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:17,966 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:17,966 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-11-06 21:15:17,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058355754] [2019-11-06 21:15:17,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:15:17,967 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:15:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:15:17,969 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 11 states. [2019-11-06 21:15:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:18,280 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-06 21:15:18,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:15:18,281 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-06 21:15:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:18,282 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:15:18,282 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 21:15:18,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:15:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 21:15:18,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2019-11-06 21:15:18,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 21:15:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2019-11-06 21:15:18,291 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 24 [2019-11-06 21:15:18,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:18,291 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2019-11-06 21:15:18,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:15:18,291 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2019-11-06 21:15:18,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:15:18,292 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:18,292 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:18,497 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:18,498 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:18,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1286279711, now seen corresponding path program 1 times [2019-11-06 21:15:18,499 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:18,500 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720951810] [2019-11-06 21:15:18,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:18,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:18,628 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:18,629 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720951810] [2019-11-06 21:15:18,629 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663780979] [2019-11-06 21:15:18,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:18,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-06 21:15:18,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:18,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:18,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:18,761 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:18,762 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,775 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 11 treesize of output 7 [2019-11-06 21:15:18,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,789 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,790 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-06 21:15:18,805 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:18,806 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:18,806 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,810 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-06 21:15:18,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:18,830 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,835 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,836 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:18,837 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-06 21:15:18,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:18,867 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:18,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:18,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:18,874 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:18,874 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-11-06 21:15:18,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639871492] [2019-11-06 21:15:18,874 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:15:18,875 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:18,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:15:18,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:15:18,875 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand 11 states. [2019-11-06 21:15:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:19,290 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2019-11-06 21:15:19,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:15:19,290 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2019-11-06 21:15:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:19,291 INFO L225 Difference]: With dead ends: 65 [2019-11-06 21:15:19,291 INFO L226 Difference]: Without dead ends: 59 [2019-11-06 21:15:19,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:15:19,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-06 21:15:19,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-11-06 21:15:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-06 21:15:19,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-11-06 21:15:19,299 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 24 [2019-11-06 21:15:19,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:19,299 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-11-06 21:15:19,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:15:19,300 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-11-06 21:15:19,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:15:19,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:19,301 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:19,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:19,502 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:19,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:19,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1587413318, now seen corresponding path program 1 times [2019-11-06 21:15:19,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:19,503 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361442568] [2019-11-06 21:15:19,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:19,750 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361442568] [2019-11-06 21:15:19,751 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667172523] [2019-11-06 21:15:19,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:19,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:19,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-06 21:15:19,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:19,865 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:19,866 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,870 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,870 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,871 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:19,923 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:19,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,929 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,929 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-06 21:15:19,951 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:19,952 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:19,968 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,982 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,983 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-06 21:15:20,013 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.base_18|, |v_#memory_$Pointer$.offset_16|]} [2019-11-06 21:15:20,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-11-06 21:15:20,018 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,031 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,053 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-06 21:15:20,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:20,057 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,076 INFO L567 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2019-11-06 21:15:20,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-06 21:15:20,082 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,088 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-06 21:15:20,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-06 21:15:20,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:15:20,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,138 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,139 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-06 21:15:20,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:20,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,146 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,146 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:15:20,149 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:20,149 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:20,149 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-06 21:15:20,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743734045] [2019-11-06 21:15:20,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:15:20,150 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:20,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:15:20,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:15:20,151 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 15 states. [2019-11-06 21:15:20,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:20,551 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2019-11-06 21:15:20,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:15:20,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 26 [2019-11-06 21:15:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:20,552 INFO L225 Difference]: With dead ends: 67 [2019-11-06 21:15:20,552 INFO L226 Difference]: Without dead ends: 63 [2019-11-06 21:15:20,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:20,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-06 21:15:20,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 51. [2019-11-06 21:15:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-06 21:15:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-11-06 21:15:20,559 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 26 [2019-11-06 21:15:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:20,560 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-06 21:15:20,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:15:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2019-11-06 21:15:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:15:20,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:20,561 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:20,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:20,765 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:20,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:20,765 INFO L82 PathProgramCache]: Analyzing trace with hash -742131883, now seen corresponding path program 2 times [2019-11-06 21:15:20,766 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:20,766 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707515037] [2019-11-06 21:15:20,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:20,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:20,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:20,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707515037] [2019-11-06 21:15:20,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38556150] [2019-11-06 21:15:20,926 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-11-06 21:15:21,032 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:21,033 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:21,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 36 conjunts are in the unsatisfiable core [2019-11-06 21:15:21,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:21,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:21,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,057 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:21,075 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,075 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:21,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,087 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,087 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-06 21:15:21,097 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 11 treesize of output 7 [2019-11-06 21:15:21,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,119 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 11 treesize of output 7 [2019-11-06 21:15:21,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,133 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2019-11-06 21:15:21,144 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_23|], 2=[|v_#memory_$Pointer$.offset_18|, |v_#memory_$Pointer$.base_20|]} [2019-11-06 21:15:21,149 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 23 treesize of output 15 [2019-11-06 21:15:21,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,169 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 68 [2019-11-06 21:15:21,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,203 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 85 [2019-11-06 21:15:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,205 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,218 INFO L567 ElimStorePlain]: treesize reduction 36, result has 42.9 percent of original size [2019-11-06 21:15:21,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,219 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2019-11-06 21:15:21,245 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 31 treesize of output 19 [2019-11-06 21:15:21,245 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,251 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,256 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-11-06 21:15:21,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2019-11-06 21:15:21,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:21,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,270 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,270 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,271 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:15:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:21,274 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:21,274 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-06 21:15:21,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421182995] [2019-11-06 21:15:21,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:15:21,275 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:21,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:15:21,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:15:21,276 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand 11 states. [2019-11-06 21:15:21,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:21,615 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-11-06 21:15:21,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:15:21,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-06 21:15:21,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:21,617 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:15:21,617 INFO L226 Difference]: Without dead ends: 59 [2019-11-06 21:15:21,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:15:21,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-06 21:15:21,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 42. [2019-11-06 21:15:21,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-06 21:15:21,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2019-11-06 21:15:21,624 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 28 [2019-11-06 21:15:21,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:21,625 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2019-11-06 21:15:21,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:15:21,625 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2019-11-06 21:15:21,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:15:21,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:21,626 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:21,829 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:21,830 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:21,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:21,831 INFO L82 PathProgramCache]: Analyzing trace with hash 1474620245, now seen corresponding path program 1 times [2019-11-06 21:15:21,831 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:21,831 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138152705] [2019-11-06 21:15:21,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:21,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:21,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:15:21,978 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138152705] [2019-11-06 21:15:21,978 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [236806097] [2019-11-06 21:15:21,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:22,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 25 conjunts are in the unsatisfiable core [2019-11-06 21:15:22,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:22,082 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:22,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,085 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,085 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:22,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,099 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:22,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,111 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 11 treesize of output 7 [2019-11-06 21:15:22,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,118 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,119 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-06 21:15:22,137 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:22,137 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:22,138 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,146 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,147 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,147 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-06 21:15:22,164 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:22,165 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:22,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-06 21:15:22,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:22,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,202 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,202 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:15:22,205 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:22,205 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-11-06 21:15:22,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842527655] [2019-11-06 21:15:22,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:15:22,206 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:15:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:15:22,207 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand 11 states. [2019-11-06 21:15:22,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:22,468 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2019-11-06 21:15:22,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:15:22,468 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2019-11-06 21:15:22,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:22,469 INFO L225 Difference]: With dead ends: 67 [2019-11-06 21:15:22,469 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 21:15:22,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:15:22,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 21:15:22,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 44. [2019-11-06 21:15:22,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-11-06 21:15:22,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2019-11-06 21:15:22,476 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 28 [2019-11-06 21:15:22,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:22,476 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2019-11-06 21:15:22,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:15:22,476 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2019-11-06 21:15:22,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:15:22,477 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:22,477 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:22,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:22,681 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:22,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:22,682 INFO L82 PathProgramCache]: Analyzing trace with hash -149429434, now seen corresponding path program 2 times [2019-11-06 21:15:22,682 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:22,682 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938702824] [2019-11-06 21:15:22,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:22,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:22,854 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938702824] [2019-11-06 21:15:22,854 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117753299] [2019-11-06 21:15:22,854 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:22,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:22,977 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:22,979 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-06 21:15:22,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:22,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:22,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,995 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:23,031 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:23,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,048 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,053 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 11 treesize of output 7 [2019-11-06 21:15:23,054 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,062 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,063 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,063 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-06 21:15:23,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:23,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:23,075 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,116 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,116 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:15:23,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:23,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:23,147 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,160 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,160 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-06 21:15:23,200 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:23,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:23,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:23,211 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:23,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:15:23,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,324 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-06 21:15:23,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,329 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:23,329 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-06 21:15:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:23,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:23,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:23,636 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:23,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:23,643 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:23,643 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2019-11-06 21:15:23,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599869032] [2019-11-06 21:15:23,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:15:23,647 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:23,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:15:23,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:23,648 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand 18 states. [2019-11-06 21:15:24,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:24,590 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2019-11-06 21:15:24,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-06 21:15:24,590 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-11-06 21:15:24,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:24,591 INFO L225 Difference]: With dead ends: 84 [2019-11-06 21:15:24,591 INFO L226 Difference]: Without dead ends: 78 [2019-11-06 21:15:24,592 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=226, Invalid=896, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:15:24,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-06 21:15:24,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 57. [2019-11-06 21:15:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-06 21:15:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2019-11-06 21:15:24,600 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 28 [2019-11-06 21:15:24,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:24,601 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2019-11-06 21:15:24,601 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:15:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2019-11-06 21:15:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:15:24,602 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:24,602 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:24,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:24,807 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:24,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1774322197, now seen corresponding path program 1 times [2019-11-06 21:15:24,809 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:24,809 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954725171] [2019-11-06 21:15:24,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:24,989 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:24,989 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954725171] [2019-11-06 21:15:24,991 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253791853] [2019-11-06 21:15:24,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:25,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 32 conjunts are in the unsatisfiable core [2019-11-06 21:15:25,104 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:25,108 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:25,108 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:25,140 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:25,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,145 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,145 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,145 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-11-06 21:15:25,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:25,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,187 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:25,187 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,197 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,197 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-11-06 21:15:25,222 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_21|]} [2019-11-06 21:15:25,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2019-11-06 21:15:25,227 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,287 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2019-11-06 21:15:25,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:25,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:25,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:25,291 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:15:25,318 INFO L567 ElimStorePlain]: treesize reduction 188, result has 28.5 percent of original size [2019-11-06 21:15:25,321 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2019-11-06 21:15:25,322 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,326 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,327 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,327 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-11-06 21:15:25,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-11-06 21:15:25,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,368 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:15:25,371 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,374 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,375 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-11-06 21:15:25,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:25,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:25,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:25,380 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:15:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:25,383 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:25,383 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-11-06 21:15:25,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146875925] [2019-11-06 21:15:25,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-06 21:15:25,384 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:25,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-06 21:15:25,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:15:25,385 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand 15 states. [2019-11-06 21:15:25,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:25,738 INFO L93 Difference]: Finished difference Result 77 states and 88 transitions. [2019-11-06 21:15:25,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:15:25,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2019-11-06 21:15:25,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:25,740 INFO L225 Difference]: With dead ends: 77 [2019-11-06 21:15:25,740 INFO L226 Difference]: Without dead ends: 64 [2019-11-06 21:15:25,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:25,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-06 21:15:25,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-11-06 21:15:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-11-06 21:15:25,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2019-11-06 21:15:25,746 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 28 [2019-11-06 21:15:25,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:25,746 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2019-11-06 21:15:25,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-06 21:15:25,746 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2019-11-06 21:15:25,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:15:25,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:25,747 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:25,951 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:25,951 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:25,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash 150272518, now seen corresponding path program 1 times [2019-11-06 21:15:25,952 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:25,952 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670748461] [2019-11-06 21:15:25,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:26,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:26,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:26,115 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670748461] [2019-11-06 21:15:26,115 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683460286] [2019-11-06 21:15:26,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:26,215 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 21:15:26,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:26,229 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:26,229 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:26,247 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:26,248 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,276 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 11 treesize of output 7 [2019-11-06 21:15:26,276 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,284 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-06 21:15:26,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,294 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:26,295 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,301 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,301 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:15:26,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:26,342 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:26,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,351 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,352 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,352 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-06 21:15:26,390 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:26,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:26,390 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,400 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:26,400 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:26,456 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,456 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:15:26,457 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,498 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-06 21:15:26,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,501 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:26,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-06 21:15:26,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:26,706 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:26,706 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:26,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:26,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:26,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:26,716 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:26,717 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2019-11-06 21:15:26,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001224018] [2019-11-06 21:15:26,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:15:26,717 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:26,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:15:26,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:26,718 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand 18 states. [2019-11-06 21:15:27,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:27,550 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2019-11-06 21:15:27,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-06 21:15:27,550 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2019-11-06 21:15:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:27,551 INFO L225 Difference]: With dead ends: 98 [2019-11-06 21:15:27,551 INFO L226 Difference]: Without dead ends: 92 [2019-11-06 21:15:27,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=223, Invalid=899, Unknown=0, NotChecked=0, Total=1122 [2019-11-06 21:15:27,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-11-06 21:15:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 56. [2019-11-06 21:15:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-06 21:15:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2019-11-06 21:15:27,559 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 28 [2019-11-06 21:15:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:27,560 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2019-11-06 21:15:27,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:15:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2019-11-06 21:15:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:15:27,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:27,566 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:27,771 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:27,772 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:27,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:27,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1819088671, now seen corresponding path program 3 times [2019-11-06 21:15:27,773 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:27,773 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397918295] [2019-11-06 21:15:27,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:27,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:27,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:28,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:28,000 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397918295] [2019-11-06 21:15:28,000 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326672782] [2019-11-06 21:15:28,001 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:28,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 21:15:28,122 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:28,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 62 conjunts are in the unsatisfiable core [2019-11-06 21:15:28,125 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:28,140 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:28,141 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,144 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:28,162 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:28,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,191 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:15:28,192 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,192 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:15:28,232 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 11 treesize of output 7 [2019-11-06 21:15:28,233 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,258 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 11 treesize of output 7 [2019-11-06 21:15:28,258 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,271 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,272 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,272 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-06 21:15:28,321 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,322 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 20 treesize of output 30 [2019-11-06 21:15:28,322 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,352 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,354 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_38|], 2=[|v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_24|]} [2019-11-06 21:15:28,358 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:15:28,359 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:28,394 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 39 treesize of output 19 [2019-11-06 21:15:28,395 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,415 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,418 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:28,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-06 21:15:28,419 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,437 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:51 [2019-11-06 21:15:28,484 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:28,495 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,495 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 129 [2019-11-06 21:15:28,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,497 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,551 INFO L567 ElimStorePlain]: treesize reduction 24, result has 86.4 percent of original size [2019-11-06 21:15:28,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 140 [2019-11-06 21:15:28,571 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,625 INFO L567 ElimStorePlain]: treesize reduction 24, result has 81.4 percent of original size [2019-11-06 21:15:28,630 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 39 treesize of output 15 [2019-11-06 21:15:28,631 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,653 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,654 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2019-11-06 21:15:28,694 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_40|], 5=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_29|]} [2019-11-06 21:15:28,698 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 47 treesize of output 38 [2019-11-06 21:15:28,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,753 INFO L567 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2019-11-06 21:15:28,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:28,776 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 152 treesize of output 173 [2019-11-06 21:15:28,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,798 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,805 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2019-11-06 21:15:28,806 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,831 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.4 percent of original size [2019-11-06 21:15:28,831 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,832 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2019-11-06 21:15:28,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2019-11-06 21:15:28,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,913 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:28,914 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:28,945 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-11-06 21:15:28,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:28,949 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:28,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:28,959 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:28,960 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2019-11-06 21:15:29,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:29,039 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-06 21:15:29,040 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:29,054 INFO L567 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2019-11-06 21:15:29,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:29,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-06 21:15:29,061 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:29,061 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:29,061 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-11-06 21:15:29,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824663376] [2019-11-06 21:15:29,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:15:29,062 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:29,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:15:29,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:29,063 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand 20 states. [2019-11-06 21:15:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:29,915 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-11-06 21:15:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:15:29,916 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-06 21:15:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:29,917 INFO L225 Difference]: With dead ends: 85 [2019-11-06 21:15:29,918 INFO L226 Difference]: Without dead ends: 81 [2019-11-06 21:15:29,919 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2019-11-06 21:15:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2019-11-06 21:15:29,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 65. [2019-11-06 21:15:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-06 21:15:29,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2019-11-06 21:15:29,925 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 30 [2019-11-06 21:15:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:29,925 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2019-11-06 21:15:29,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:15:29,925 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2019-11-06 21:15:29,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:15:29,926 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:29,926 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:30,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:30,130 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:30,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:30,131 INFO L82 PathProgramCache]: Analyzing trace with hash -768010655, now seen corresponding path program 1 times [2019-11-06 21:15:30,131 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:30,131 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56264683] [2019-11-06 21:15:30,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:30,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:30,301 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56264683] [2019-11-06 21:15:30,301 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084103634] [2019-11-06 21:15:30,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:30,408 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 41 conjunts are in the unsatisfiable core [2019-11-06 21:15:30,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:30,420 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:30,421 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:30,437 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:30,438 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,450 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 11 treesize of output 7 [2019-11-06 21:15:30,450 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,458 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-06 21:15:30,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:30,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:30,468 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,472 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:15:30,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:30,491 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:30,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,500 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,500 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-06 21:15:30,536 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:30,537 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:30,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,548 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:30,548 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:30,607 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,608 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:15:30,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,651 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-06 21:15:30,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,654 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:30,655 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-06 21:15:30,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:30,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-06 21:15:30,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:30,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:30,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-11-06 21:15:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:30,832 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:30,832 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 18 [2019-11-06 21:15:30,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724558551] [2019-11-06 21:15:30,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:15:30,833 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:30,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:15:30,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:30,833 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 18 states. [2019-11-06 21:15:31,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:31,750 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-11-06 21:15:31,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 21:15:31,751 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 30 [2019-11-06 21:15:31,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:31,752 INFO L225 Difference]: With dead ends: 124 [2019-11-06 21:15:31,752 INFO L226 Difference]: Without dead ends: 112 [2019-11-06 21:15:31,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=955, Unknown=0, NotChecked=0, Total=1190 [2019-11-06 21:15:31,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-06 21:15:31,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 84. [2019-11-06 21:15:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-11-06 21:15:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2019-11-06 21:15:31,761 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 30 [2019-11-06 21:15:31,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:31,761 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2019-11-06 21:15:31,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:15:31,761 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2019-11-06 21:15:31,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 21:15:31,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:31,762 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:31,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:31,966 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:31,966 INFO L82 PathProgramCache]: Analyzing trace with hash 256692321, now seen corresponding path program 2 times [2019-11-06 21:15:31,967 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:31,967 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146900837] [2019-11-06 21:15:31,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:32,183 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:32,183 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146900837] [2019-11-06 21:15:32,183 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95339304] [2019-11-06 21:15:32,183 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:32,291 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:32,291 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:32,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 50 conjunts are in the unsatisfiable core [2019-11-06 21:15:32,294 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:32,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:32,299 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,302 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,302 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:32,329 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:32,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,354 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:15:32,354 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:15:32,396 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 11 treesize of output 7 [2019-11-06 21:15:32,396 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,425 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 11 treesize of output 7 [2019-11-06 21:15:32,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,446 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,446 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,447 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-06 21:15:32,507 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,508 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 20 treesize of output 30 [2019-11-06 21:15:32,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,538 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,540 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_46|], 2=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_32|]} [2019-11-06 21:15:32,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:15:32,546 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:32,582 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 23 treesize of output 11 [2019-11-06 21:15:32,583 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,632 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:15:32,632 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-06 21:15:32,633 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,662 INFO L567 ElimStorePlain]: treesize reduction 8, result has 82.2 percent of original size [2019-11-06 21:15:32,663 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,663 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:86, output treesize:37 [2019-11-06 21:15:32,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:32,709 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 55 treesize of output 19 [2019-11-06 21:15:32,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,747 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,747 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 109 [2019-11-06 21:15:32,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:32,748 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,786 INFO L567 ElimStorePlain]: treesize reduction 26, result has 79.0 percent of original size [2019-11-06 21:15:32,790 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 61 [2019-11-06 21:15:32,790 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,807 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,808 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,808 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2019-11-06 21:15:32,848 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_48|, |v_#memory_$Pointer$.offset_31|], 6=[|v_#memory_$Pointer$.base_34|]} [2019-11-06 21:15:32,852 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 55 treesize of output 40 [2019-11-06 21:15:32,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:32,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,892 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 185 [2019-11-06 21:15:32,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:32,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:32,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:32,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:32,896 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:15:32,947 INFO L567 ElimStorePlain]: treesize reduction 298, result has 32.9 percent of original size [2019-11-06 21:15:32,994 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:32,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 142 treesize of output 160 [2019-11-06 21:15:32,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:32,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:32,998 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,044 INFO L567 ElimStorePlain]: treesize reduction 134, result has 39.6 percent of original size [2019-11-06 21:15:33,045 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:33,045 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2019-11-06 21:15:33,124 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-11-06 21:15:33,126 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 84 treesize of output 64 [2019-11-06 21:15:33,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:33,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,149 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:33,150 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 47 [2019-11-06 21:15:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:33,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:33,153 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:33,179 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:15:33,180 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:33,181 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2019-11-06 21:15:33,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:33,252 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:33,253 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-11-06 21:15:33,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745960355] [2019-11-06 21:15:33,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:15:33,253 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:33,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:15:33,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:33,254 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand 20 states. [2019-11-06 21:15:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:33,932 INFO L93 Difference]: Finished difference Result 106 states and 124 transitions. [2019-11-06 21:15:33,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:15:33,932 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-11-06 21:15:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:33,933 INFO L225 Difference]: With dead ends: 106 [2019-11-06 21:15:33,934 INFO L226 Difference]: Without dead ends: 100 [2019-11-06 21:15:33,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=643, Unknown=0, NotChecked=0, Total=756 [2019-11-06 21:15:33,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-06 21:15:33,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 86. [2019-11-06 21:15:33,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-06 21:15:33,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 101 transitions. [2019-11-06 21:15:33,943 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 101 transitions. Word has length 30 [2019-11-06 21:15:33,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:33,943 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 101 transitions. [2019-11-06 21:15:33,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:15:33,943 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 101 transitions. [2019-11-06 21:15:33,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:15:33,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:33,944 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:34,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:34,149 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:34,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:34,150 INFO L82 PathProgramCache]: Analyzing trace with hash -43846724, now seen corresponding path program 4 times [2019-11-06 21:15:34,150 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:34,150 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844133177] [2019-11-06 21:15:34,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:34,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:34,520 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:34,520 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844133177] [2019-11-06 21:15:34,520 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399749718] [2019-11-06 21:15:34,521 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:34,673 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:15:34,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:34,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 63 conjunts are in the unsatisfiable core [2019-11-06 21:15:34,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:34,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:34,687 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,696 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:34,716 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,716 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:34,717 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,731 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-11-06 21:15:34,777 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 11 treesize of output 7 [2019-11-06 21:15:34,777 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,799 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 11 treesize of output 7 [2019-11-06 21:15:34,799 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,816 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-11-06 21:15:34,861 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:34,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2019-11-06 21:15:34,862 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:34,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-11-06 21:15:34,883 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,896 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,897 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:66, output treesize:36 [2019-11-06 21:15:34,939 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:34,952 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 93 treesize of output 87 [2019-11-06 21:15:34,953 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:34,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,988 INFO L567 ElimStorePlain]: treesize reduction 16, result has 85.6 percent of original size [2019-11-06 21:15:34,991 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 66 [2019-11-06 21:15:34,992 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:103, output treesize:70 [2019-11-06 21:15:35,047 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_49|], 6=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_35|]} [2019-11-06 21:15:35,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-11-06 21:15:35,051 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,072 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,076 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:35,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 231 treesize of output 232 [2019-11-06 21:15:35,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:35,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:35,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:35,136 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-06 21:15:35,262 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2019-11-06 21:15:35,263 INFO L567 ElimStorePlain]: treesize reduction 1226, result has 11.4 percent of original size [2019-11-06 21:15:35,297 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,298 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 153 treesize of output 180 [2019-11-06 21:15:35,299 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,308 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,309 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:259, output treesize:45 [2019-11-06 21:15:35,479 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:35,495 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-11-06 21:15:35,496 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 84 treesize of output 60 [2019-11-06 21:15:35,497 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,499 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:35,533 INFO L567 ElimStorePlain]: treesize reduction 8, result has 87.7 percent of original size [2019-11-06 21:15:35,540 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,541 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 30 [2019-11-06 21:15:35,541 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:35,551 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:98, output treesize:29 [2019-11-06 21:15:35,603 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,603 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2019-11-06 21:15:35,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,618 INFO L567 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-11-06 21:15:35,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2019-11-06 21:15:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:35,627 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:35,628 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2019-11-06 21:15:35,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994535167] [2019-11-06 21:15:35,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-06 21:15:35,628 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:35,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-06 21:15:35,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:15:35,629 INFO L87 Difference]: Start difference. First operand 86 states and 101 transitions. Second operand 23 states. [2019-11-06 21:15:36,888 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-06 21:15:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:37,176 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2019-11-06 21:15:37,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-06 21:15:37,176 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 32 [2019-11-06 21:15:37,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:37,178 INFO L225 Difference]: With dead ends: 120 [2019-11-06 21:15:37,178 INFO L226 Difference]: Without dead ends: 114 [2019-11-06 21:15:37,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2019-11-06 21:15:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-06 21:15:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 96. [2019-11-06 21:15:37,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-06 21:15:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 114 transitions. [2019-11-06 21:15:37,187 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 114 transitions. Word has length 32 [2019-11-06 21:15:37,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:37,188 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 114 transitions. [2019-11-06 21:15:37,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-06 21:15:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 114 transitions. [2019-11-06 21:15:37,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:15:37,188 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:37,189 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:37,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:37,392 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:37,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:37,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1017812589, now seen corresponding path program 2 times [2019-11-06 21:15:37,393 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:37,393 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912156249] [2019-11-06 21:15:37,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:37,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:37,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:37,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:37,619 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912156249] [2019-11-06 21:15:37,619 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011647963] [2019-11-06 21:15:37,619 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 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:37,730 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:37,730 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:37,731 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 52 conjunts are in the unsatisfiable core [2019-11-06 21:15:37,733 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:37,745 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:37,745 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,749 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,749 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:37,769 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,770 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:37,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,797 INFO L567 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2019-11-06 21:15:37,801 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 11 treesize of output 7 [2019-11-06 21:15:37,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,815 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,815 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2019-11-06 21:15:37,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:37,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:37,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,858 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,858 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:37,894 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,895 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:15:37,895 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:37,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,923 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,924 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,924 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2019-11-06 21:15:37,961 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:37,962 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:37,962 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,973 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:37,973 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:37,974 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-11-06 21:15:38,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-11-06 21:15:38,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:38,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:38,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:38,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:40 [2019-11-06 21:15:38,101 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:38,102 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 31 [2019-11-06 21:15:38,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:38,117 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:38,117 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:38,117 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-11-06 21:15:38,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:38,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 102 [2019-11-06 21:15:38,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:38,261 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-11-06 21:15:38,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,265 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:38,266 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-11-06 21:15:38,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:38,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-06 21:15:38,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:38,518 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:38,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:38,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-11-06 21:15:38,525 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:38,525 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:38,525 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 24 [2019-11-06 21:15:38,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957298620] [2019-11-06 21:15:38,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-06 21:15:38,526 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-06 21:15:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2019-11-06 21:15:38,527 INFO L87 Difference]: Start difference. First operand 96 states and 114 transitions. Second operand 24 states. [2019-11-06 21:15:39,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:39,763 INFO L93 Difference]: Finished difference Result 138 states and 163 transitions. [2019-11-06 21:15:39,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:15:39,765 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-11-06 21:15:39,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:39,766 INFO L225 Difference]: With dead ends: 138 [2019-11-06 21:15:39,766 INFO L226 Difference]: Without dead ends: 130 [2019-11-06 21:15:39,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 302 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=236, Invalid=1096, Unknown=0, NotChecked=0, Total=1332 [2019-11-06 21:15:39,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-11-06 21:15:39,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 92. [2019-11-06 21:15:39,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-06 21:15:39,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 108 transitions. [2019-11-06 21:15:39,774 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 108 transitions. Word has length 32 [2019-11-06 21:15:39,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:39,775 INFO L462 AbstractCegarLoop]: Abstraction has 92 states and 108 transitions. [2019-11-06 21:15:39,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-06 21:15:39,775 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2019-11-06 21:15:39,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:39,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:39,776 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:39,979 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:39,979 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:39,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:39,980 INFO L82 PathProgramCache]: Analyzing trace with hash 861647831, now seen corresponding path program 5 times [2019-11-06 21:15:39,980 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:39,980 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146080468] [2019-11-06 21:15:39,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:40,311 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:40,311 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146080468] [2019-11-06 21:15:40,312 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694912003] [2019-11-06 21:15:40,312 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:40,450 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2019-11-06 21:15:40,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:40,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-06 21:15:40,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:40,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:40,459 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,461 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:15:40,574 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:40,575 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,639 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-11-06 21:15:40,639 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-11-06 21:15:40,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:40,674 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 21:15:40,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,706 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:59, output treesize:45 [2019-11-06 21:15:40,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 21:15:40,754 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,772 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:40,778 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 25 treesize of output 13 [2019-11-06 21:15:40,779 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,792 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,812 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-06 21:15:40,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 31 [2019-11-06 21:15:40,812 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,835 INFO L567 ElimStorePlain]: treesize reduction 10, result has 77.3 percent of original size [2019-11-06 21:15:40,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,835 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:34 [2019-11-06 21:15:40,868 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-11-06 21:15:40,868 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,887 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,910 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:40,910 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 127 [2019-11-06 21:15:40,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:40,912 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,948 INFO L567 ElimStorePlain]: treesize reduction 34, result has 76.2 percent of original size [2019-11-06 21:15:40,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:40,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:124 [2019-11-06 21:15:40,990 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_57|], 6=[|v_#memory_$Pointer$.offset_40|, |v_#memory_$Pointer$.base_44|]} [2019-11-06 21:15:41,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2019-11-06 21:15:41,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,148 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 284 [2019-11-06 21:15:41,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,171 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 7 xjuncts. [2019-11-06 21:15:41,285 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 37 [2019-11-06 21:15:41,285 INFO L567 ElimStorePlain]: treesize reduction 1595, result has 10.0 percent of original size [2019-11-06 21:15:41,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,345 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 184 [2019-11-06 21:15:41,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,362 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:41,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,369 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-11-06 21:15:41,462 INFO L567 ElimStorePlain]: treesize reduction 1591, result has 6.3 percent of original size [2019-11-06 21:15:41,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,462 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:357, output treesize:107 [2019-11-06 21:15:41,592 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,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, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 78 [2019-11-06 21:15:41,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:41,594 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:41,621 INFO L567 ElimStorePlain]: treesize reduction 22, result has 69.4 percent of original size [2019-11-06 21:15:41,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2019-11-06 21:15:41,625 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:149, output treesize:11 [2019-11-06 21:15:41,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:41,667 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,668 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:41,669 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:41,669 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 21:15:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:41,679 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:41,679 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2019-11-06 21:15:41,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507035803] [2019-11-06 21:15:41,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-06 21:15:41,681 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-06 21:15:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=448, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:15:41,682 INFO L87 Difference]: Start difference. First operand 92 states and 108 transitions. Second operand 23 states. [2019-11-06 21:15:42,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:42,714 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2019-11-06 21:15:42,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:15:42,715 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2019-11-06 21:15:42,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:42,716 INFO L225 Difference]: With dead ends: 110 [2019-11-06 21:15:42,716 INFO L226 Difference]: Without dead ends: 96 [2019-11-06 21:15:42,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=809, Unknown=0, NotChecked=0, Total=930 [2019-11-06 21:15:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-06 21:15:42,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 72. [2019-11-06 21:15:42,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 21:15:42,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 83 transitions. [2019-11-06 21:15:42,724 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 83 transitions. Word has length 34 [2019-11-06 21:15:42,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:42,724 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 83 transitions. [2019-11-06 21:15:42,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-06 21:15:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 83 transitions. [2019-11-06 21:15:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:42,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:42,725 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:42,928 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:42,929 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:42,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:42,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1881366999, now seen corresponding path program 2 times [2019-11-06 21:15:42,929 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:42,930 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304604932] [2019-11-06 21:15:42,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:42,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:43,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:15:43,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304604932] [2019-11-06 21:15:43,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747706442] [2019-11-06 21:15:43,067 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 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:43,195 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:43,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:43,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 38 conjunts are in the unsatisfiable core [2019-11-06 21:15:43,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:43,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:43,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,214 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:43,236 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,237 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 21:15:43,237 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,250 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,254 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 11 treesize of output 7 [2019-11-06 21:15:43,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,264 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,264 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,264 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2019-11-06 21:15:43,271 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:43,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:43,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,279 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,279 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,280 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-11-06 21:15:43,298 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:43,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-06 21:15:43,303 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,312 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:25 [2019-11-06 21:15:43,346 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 21:15:43,347 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 21:15:43,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,356 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:43,356 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-11-06 21:15:43,411 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 68 [2019-11-06 21:15:43,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,450 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-11-06 21:15:43,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,453 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:43,453 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-11-06 21:15:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:43,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:43,513 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2019-11-06 21:15:43,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,521 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 26 treesize of output 14 [2019-11-06 21:15:43,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,525 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 26 treesize of output 14 [2019-11-06 21:15:43,525 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:43,551 INFO L567 ElimStorePlain]: treesize reduction 24, result has 41.5 percent of original size [2019-11-06 21:15:43,551 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:43,551 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:86, output treesize:7 [2019-11-06 21:15:43,556 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:15:43,556 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:43,556 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 14 [2019-11-06 21:15:43,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455575582] [2019-11-06 21:15:43,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:15:43,558 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:43,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:15:43,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:15:43,558 INFO L87 Difference]: Start difference. First operand 72 states and 83 transitions. Second operand 14 states. [2019-11-06 21:15:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:44,088 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2019-11-06 21:15:44,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:15:44,088 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-06 21:15:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:44,090 INFO L225 Difference]: With dead ends: 99 [2019-11-06 21:15:44,090 INFO L226 Difference]: Without dead ends: 84 [2019-11-06 21:15:44,091 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=143, Invalid=507, Unknown=0, NotChecked=0, Total=650 [2019-11-06 21:15:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-11-06 21:15:44,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 72. [2019-11-06 21:15:44,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-06 21:15:44,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2019-11-06 21:15:44,095 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 34 [2019-11-06 21:15:44,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:44,096 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2019-11-06 21:15:44,096 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:15:44,096 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2019-11-06 21:15:44,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:44,096 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:44,096 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:44,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:44,297 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:44,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:44,298 INFO L82 PathProgramCache]: Analyzing trace with hash -781949048, now seen corresponding path program 6 times [2019-11-06 21:15:44,298 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:44,299 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834380706] [2019-11-06 21:15:44,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:44,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:44,716 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834380706] [2019-11-06 21:15:44,716 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890546850] [2019-11-06 21:15:44,716 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:44,856 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2019-11-06 21:15:44,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:44,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 73 conjunts are in the unsatisfiable core [2019-11-06 21:15:44,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:44,864 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:44,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,869 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:44,869 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,869 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:44,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:44,891 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:44,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,917 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:15:44,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,918 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:15:44,954 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 11 treesize of output 7 [2019-11-06 21:15:44,954 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,970 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:44,975 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 11 treesize of output 7 [2019-11-06 21:15:44,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,990 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:44,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:44,991 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-06 21:15:45,072 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,072 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-11-06 21:15:45,073 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,155 INFO L567 ElimStorePlain]: treesize reduction 40, result has 71.0 percent of original size [2019-11-06 21:15:45,156 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_43|]} [2019-11-06 21:15:45,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:15:45,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,198 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,231 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:15:45,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 32 [2019-11-06 21:15:45,232 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,285 INFO L567 ElimStorePlain]: treesize reduction 8, result has 89.3 percent of original size [2019-11-06 21:15:45,291 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 23 treesize of output 11 [2019-11-06 21:15:45,291 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,314 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,315 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:92, output treesize:52 [2019-11-06 21:15:45,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,381 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 141 [2019-11-06 21:15:45,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:45,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:45,479 INFO L567 ElimStorePlain]: treesize reduction 150, result has 51.1 percent of original size [2019-11-06 21:15:45,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 139 treesize of output 117 [2019-11-06 21:15:45,483 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,516 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:45,524 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 55 treesize of output 19 [2019-11-06 21:15:45,524 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,549 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,550 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:164, output treesize:117 [2019-11-06 21:15:45,618 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,618 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 39 treesize of output 55 [2019-11-06 21:15:45,619 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,663 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_45|, |v_#memory_int_65|], 6=[|v_#memory_$Pointer$.base_49|]} [2019-11-06 21:15:45,688 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:15:45,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 86 [2019-11-06 21:15:45,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,691 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:45,768 INFO L567 ElimStorePlain]: treesize reduction 8, result has 94.2 percent of original size [2019-11-06 21:15:45,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:45,780 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 23 treesize of output 22 [2019-11-06 21:15:45,781 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:45,903 INFO L341 Elim1Store]: treesize reduction 44, result has 52.7 percent of original size [2019-11-06 21:15:45,904 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 82 [2019-11-06 21:15:45,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:45,907 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:45,974 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.0 percent of original size [2019-11-06 21:15:45,974 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:45,975 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:166, output treesize:82 [2019-11-06 21:15:46,038 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_46|], 6=[|v_#memory_int_66|, |v_#memory_$Pointer$.base_50|]} [2019-11-06 21:15:46,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:46,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 284 treesize of output 252 [2019-11-06 21:15:46,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:46,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-06 21:15:46,196 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-06 21:15:46,196 INFO L567 ElimStorePlain]: treesize reduction 546, result has 34.7 percent of original size [2019-11-06 21:15:46,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:46,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 211 [2019-11-06 21:15:46,203 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:46,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:46,302 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:46,302 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 221 treesize of output 193 [2019-11-06 21:15:46,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:46,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,308 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:46,427 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 49 [2019-11-06 21:15:46,427 INFO L567 ElimStorePlain]: treesize reduction 316, result has 40.0 percent of original size [2019-11-06 21:15:46,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:46,429 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:307, output treesize:247 [2019-11-06 21:15:46,495 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_47|, |v_#memory_int_67|], 12=[|v_#memory_$Pointer$.base_51|]} [2019-11-06 21:15:46,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:46,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 491 treesize of output 430 [2019-11-06 21:15:46,565 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:46,661 INFO L567 ElimStorePlain]: treesize reduction 168, result has 66.1 percent of original size [2019-11-06 21:15:46,666 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 70 [2019-11-06 21:15:46,667 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:46,706 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:46,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:46,778 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 300 treesize of output 240 [2019-11-06 21:15:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:46,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:46,787 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:46,912 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-06 21:15:46,912 INFO L567 ElimStorePlain]: treesize reduction 2178, result has 9.5 percent of original size [2019-11-06 21:15:46,913 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:46,913 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:502, output treesize:228 [2019-11-06 21:15:47,061 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 6=[|#memory_$Pointer$.base|]} [2019-11-06 21:15:47,068 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:47,069 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 224 treesize of output 191 [2019-11-06 21:15:47,070 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:47,112 INFO L567 ElimStorePlain]: treesize reduction 44, result has 78.4 percent of original size [2019-11-06 21:15:47,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:47,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 153 treesize of output 95 [2019-11-06 21:15:47,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:47,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:47,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:47,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:47,139 INFO L496 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:47,177 INFO L567 ElimStorePlain]: treesize reduction 44, result has 52.7 percent of original size [2019-11-06 21:15:47,178 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:47,178 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:246, output treesize:49 [2019-11-06 21:15:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:47,275 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:47,275 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2019-11-06 21:15:47,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328407759] [2019-11-06 21:15:47,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-06 21:15:47,276 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:47,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-06 21:15:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=613, Unknown=0, NotChecked=0, Total=702 [2019-11-06 21:15:47,277 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 27 states. [2019-11-06 21:15:49,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:49,618 INFO L93 Difference]: Finished difference Result 134 states and 152 transitions. [2019-11-06 21:15:49,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-06 21:15:49,619 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-06 21:15:49,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:49,620 INFO L225 Difference]: With dead ends: 134 [2019-11-06 21:15:49,620 INFO L226 Difference]: Without dead ends: 126 [2019-11-06 21:15:49,622 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=306, Invalid=1950, Unknown=0, NotChecked=0, Total=2256 [2019-11-06 21:15:49,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-06 21:15:49,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 94. [2019-11-06 21:15:49,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-06 21:15:49,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 109 transitions. [2019-11-06 21:15:49,628 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 109 transitions. Word has length 34 [2019-11-06 21:15:49,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:49,629 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 109 transitions. [2019-11-06 21:15:49,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-06 21:15:49,629 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 109 transitions. [2019-11-06 21:15:49,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:49,629 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:49,629 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:49,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:49,834 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:49,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1577347223, now seen corresponding path program 1 times [2019-11-06 21:15:49,835 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:49,835 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130016160] [2019-11-06 21:15:49,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:49,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:50,038 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:15:50,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130016160] [2019-11-06 21:15:50,038 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954113246] [2019-11-06 21:15:50,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:50,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:50,166 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 59 conjunts are in the unsatisfiable core [2019-11-06 21:15:50,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:50,171 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:50,171 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:50,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:50,201 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,231 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:15:50,231 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:15:50,264 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 11 treesize of output 7 [2019-11-06 21:15:50,265 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,285 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 11 treesize of output 7 [2019-11-06 21:15:50,285 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,300 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-06 21:15:50,342 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,343 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 20 treesize of output 30 [2019-11-06 21:15:50,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,371 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,372 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_68|], 2=[|v_#memory_$Pointer$.offset_49|, |v_#memory_$Pointer$.base_53|]} [2019-11-06 21:15:50,377 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:15:50,377 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,402 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,408 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:50,410 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 23 treesize of output 11 [2019-11-06 21:15:50,410 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,455 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:15:50,455 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-06 21:15:50,456 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,493 INFO L567 ElimStorePlain]: treesize reduction 8, result has 83.3 percent of original size [2019-11-06 21:15:50,494 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,494 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2019-11-06 21:15:50,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:50,539 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 55 treesize of output 19 [2019-11-06 21:15:50,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 82 [2019-11-06 21:15:50,570 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 118 [2019-11-06 21:15:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:50,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:50,613 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:50,677 INFO L567 ElimStorePlain]: treesize reduction 111, result has 49.3 percent of original size [2019-11-06 21:15:50,678 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,678 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2019-11-06 21:15:50,715 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_70|], 6=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_55|]} [2019-11-06 21:15:50,719 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 69 treesize of output 54 [2019-11-06 21:15:50,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,787 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 257 [2019-11-06 21:15:50,789 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,840 INFO L567 ElimStorePlain]: treesize reduction 100, result has 61.8 percent of original size [2019-11-06 21:15:50,869 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:50,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 159 treesize of output 145 [2019-11-06 21:15:50,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:50,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:50,872 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,912 INFO L567 ElimStorePlain]: treesize reduction 86, result has 55.0 percent of original size [2019-11-06 21:15:50,912 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:50,913 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2019-11-06 21:15:51,024 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:51,024 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 68 [2019-11-06 21:15:51,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:51,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:51,026 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:51,060 INFO L567 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2019-11-06 21:15:51,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-11-06 21:15:51,064 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:51,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:51,075 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:51,076 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2019-11-06 21:15:51,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:51,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2019-11-06 21:15:51,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:51,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:51,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:51,130 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-11-06 21:15:51,136 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:15:51,136 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:51,136 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-11-06 21:15:51,136 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080387224] [2019-11-06 21:15:51,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:15:51,137 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:51,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:15:51,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:51,137 INFO L87 Difference]: Start difference. First operand 94 states and 109 transitions. Second operand 20 states. [2019-11-06 21:15:51,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:51,829 INFO L93 Difference]: Finished difference Result 119 states and 136 transitions. [2019-11-06 21:15:51,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 21:15:51,829 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-11-06 21:15:51,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:51,831 INFO L225 Difference]: With dead ends: 119 [2019-11-06 21:15:51,831 INFO L226 Difference]: Without dead ends: 104 [2019-11-06 21:15:51,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2019-11-06 21:15:51,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-11-06 21:15:51,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 94. [2019-11-06 21:15:51,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-06 21:15:51,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2019-11-06 21:15:51,840 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 34 [2019-11-06 21:15:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:51,840 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2019-11-06 21:15:51,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:15:51,841 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2019-11-06 21:15:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:51,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:51,841 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:52,044 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:52,045 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:52,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:52,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1828114263, now seen corresponding path program 3 times [2019-11-06 21:15:52,046 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:52,046 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093059143] [2019-11-06 21:15:52,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:52,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:52,372 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093059143] [2019-11-06 21:15:52,372 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [967470784] [2019-11-06 21:15:52,372 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:52,533 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 21:15:52,533 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:52,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 53 conjunts are in the unsatisfiable core [2019-11-06 21:15:52,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:52,548 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:52,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,552 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:52,571 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,572 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:52,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,599 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-11-06 21:15:52,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-11-06 21:15:52,632 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 11 treesize of output 7 [2019-11-06 21:15:52,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,650 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,653 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 11 treesize of output 7 [2019-11-06 21:15:52,654 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,671 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-11-06 21:15:52,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,721 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 20 treesize of output 30 [2019-11-06 21:15:52,721 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,743 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,772 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-11-06 21:15:52,773 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 27 [2019-11-06 21:15:52,773 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,806 INFO L567 ElimStorePlain]: treesize reduction 8, result has 84.9 percent of original size [2019-11-06 21:15:52,812 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 23 treesize of output 11 [2019-11-06 21:15:52,813 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,826 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,827 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:75, output treesize:30 [2019-11-06 21:15:52,877 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,877 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 111 [2019-11-06 21:15:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:52,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:52,879 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 21:15:52,932 INFO L567 ElimStorePlain]: treesize reduction 104, result has 49.3 percent of original size [2019-11-06 21:15:52,935 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 79 [2019-11-06 21:15:52,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:52,956 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:52,956 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:108, output treesize:86 [2019-11-06 21:15:52,996 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_71|], 6=[|v_#memory_$Pointer$.base_59|, |v_#memory_$Pointer$.offset_55|]} [2019-11-06 21:15:53,002 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 53 treesize of output 35 [2019-11-06 21:15:53,002 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,073 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 254 treesize of output 237 [2019-11-06 21:15:53,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,086 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 9 xjuncts. [2019-11-06 21:15:53,210 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2019-11-06 21:15:53,210 INFO L567 ElimStorePlain]: treesize reduction 1905, result has 8.3 percent of original size [2019-11-06 21:15:53,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 169 treesize of output 206 [2019-11-06 21:15:53,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,255 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:53,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,260 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,333 INFO L567 ElimStorePlain]: treesize reduction 1266, result has 6.4 percent of original size [2019-11-06 21:15:53,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,334 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:275, output treesize:87 [2019-11-06 21:15:53,412 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 118 treesize of output 67 [2019-11-06 21:15:53,413 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:53,414 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:53,438 INFO L567 ElimStorePlain]: treesize reduction 18, result has 70.5 percent of original size [2019-11-06 21:15:53,441 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2019-11-06 21:15:53,441 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,450 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:118, output treesize:7 [2019-11-06 21:15:53,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-06 21:15:53,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,456 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:53,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:53,457 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-11-06 21:15:53,464 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:53,464 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:53,464 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2019-11-06 21:15:53,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461582697] [2019-11-06 21:15:53,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:15:53,465 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:53,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:15:53,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:53,465 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand 20 states. [2019-11-06 21:15:54,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:54,342 INFO L93 Difference]: Finished difference Result 116 states and 132 transitions. [2019-11-06 21:15:54,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:15:54,344 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 34 [2019-11-06 21:15:54,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:54,345 INFO L225 Difference]: With dead ends: 116 [2019-11-06 21:15:54,345 INFO L226 Difference]: Without dead ends: 101 [2019-11-06 21:15:54,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2019-11-06 21:15:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-06 21:15:54,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 89. [2019-11-06 21:15:54,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-06 21:15:54,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2019-11-06 21:15:54,352 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 34 [2019-11-06 21:15:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:54,352 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2019-11-06 21:15:54,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:15:54,352 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2019-11-06 21:15:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:54,353 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:54,353 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:54,556 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:54,557 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:54,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:54,557 INFO L82 PathProgramCache]: Analyzing trace with hash 189501192, now seen corresponding path program 2 times [2019-11-06 21:15:54,558 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:54,558 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422191656] [2019-11-06 21:15:54,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:54,925 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:54,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422191656] [2019-11-06 21:15:54,926 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762331519] [2019-11-06 21:15:54,926 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 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:55,054 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:55,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:55,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 71 conjunts are in the unsatisfiable core [2019-11-06 21:15:55,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:55,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:15:55,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 21:15:55,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 21:15:55,089 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,120 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-11-06 21:15:55,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-11-06 21:15:55,127 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 11 treesize of output 7 [2019-11-06 21:15:55,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,149 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 11 treesize of output 7 [2019-11-06 21:15:55,149 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,166 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2019-11-06 21:15:55,190 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,191 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-11-06 21:15:55,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,217 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_72|], 2=[|v_#memory_$Pointer$.offset_57|, |v_#memory_$Pointer$.base_61|]} [2019-11-06 21:15:55,222 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 11 treesize of output 7 [2019-11-06 21:15:55,222 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,251 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 30 treesize of output 14 [2019-11-06 21:15:55,251 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,277 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 23 treesize of output 11 [2019-11-06 21:15:55,277 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,291 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:40 [2019-11-06 21:15:55,317 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_73|], 3=[|v_#memory_$Pointer$.offset_58|, |v_#memory_$Pointer$.base_62|]} [2019-11-06 21:15:55,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:55,348 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-11-06 21:15:55,348 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,400 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,400 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 101 [2019-11-06 21:15:55,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,401 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,483 INFO L567 ElimStorePlain]: treesize reduction 119, result has 39.6 percent of original size [2019-11-06 21:15:55,488 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:55,493 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:55,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 49 [2019-11-06 21:15:55,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,511 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,607 INFO L567 ElimStorePlain]: treesize reduction 29, result has 68.5 percent of original size [2019-11-06 21:15:55,607 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,608 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:124, output treesize:61 [2019-11-06 21:15:55,673 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_59|, |v_#memory_int_74|], 5=[|v_#memory_$Pointer$.base_63|]} [2019-11-06 21:15:55,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:55,678 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-06 21:15:55,679 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:55,714 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2019-11-06 21:15:55,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,804 INFO L341 Elim1Store]: treesize reduction 40, result has 49.4 percent of original size [2019-11-06 21:15:55,804 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 60 [2019-11-06 21:15:55,805 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,809 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:55,851 INFO L567 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2019-11-06 21:15:55,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,852 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:55 [2019-11-06 21:15:55,896 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_60|], 5=[|v_#memory_$Pointer$.base_64|], 6=[|v_#memory_int_75|]} [2019-11-06 21:15:55,905 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 37 treesize of output 28 [2019-11-06 21:15:55,905 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:55,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,968 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:55,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 153 [2019-11-06 21:15:55,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:55,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:55,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:15:56,092 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2019-11-06 21:15:56,093 INFO L567 ElimStorePlain]: treesize reduction 418, result has 27.7 percent of original size [2019-11-06 21:15:56,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:56,098 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 112 [2019-11-06 21:15:56,098 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:56,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:56,120 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:56,121 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:183, output treesize:99 [2019-11-06 21:15:56,170 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_$Pointer$.base_65|], 6=[|v_#memory_$Pointer$.offset_61|, |v_#memory_int_76|]} [2019-11-06 21:15:56,211 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:56,211 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 195 [2019-11-06 21:15:56,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:56,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:56,231 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts.