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-ext-properties/list-ext_flag.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:11:28,306 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:11:28,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:11:28,327 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:11:28,328 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:11:28,330 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:11:28,331 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:11:28,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:11:28,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:11:28,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:11:28,349 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:11:28,351 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:11:28,351 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:11:28,352 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:11:28,353 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:11:28,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:11:28,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:11:28,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:11:28,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:11:28,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:11:28,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:11:28,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:11:28,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:11:28,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:11:28,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:11:28,365 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:11:28,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:11:28,366 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:11:28,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:11:28,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:11:28,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:11:28,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:11:28,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:11:28,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:11:28,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:11:28,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:11:28,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:11:28,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:11:28,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:11:28,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:11:28,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:11:28,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:11:28,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:11:28,389 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:11:28,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:11:28,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:11:28,390 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:11:28,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:11:28,391 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:11:28,391 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:11:28,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:11:28,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:11:28,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:11:28,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:11:28,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:11:28,392 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:11:28,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:11:28,393 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:11:28,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:11:28,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:11:28,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:11:28,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:11:28,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:11:28,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:11:28,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:11:28,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:11:28,394 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:11:28,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:11:28,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:11:28,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:11:28,395 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:11:28,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:11:28,671 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:11:28,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:11:28,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:11:28,676 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:11:28,676 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag.i [2019-10-13 19:11:28,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3790e062e/6203ee422e624ec5a990ad3711261e89/FLAG07823c350 [2019-10-13 19:11:29,305 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:11:29,306 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext-properties/list-ext_flag.i [2019-10-13 19:11:29,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3790e062e/6203ee422e624ec5a990ad3711261e89/FLAG07823c350 [2019-10-13 19:11:29,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3790e062e/6203ee422e624ec5a990ad3711261e89 [2019-10-13 19:11:29,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:11:29,572 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:11:29,573 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:11:29,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:11:29,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:11:29,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:11:29" (1/1) ... [2019-10-13 19:11:29,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@395d602b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:29, skipping insertion in model container [2019-10-13 19:11:29,580 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:11:29" (1/1) ... [2019-10-13 19:11:29,587 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:11:29,640 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:11:30,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:11:30,080 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:11:30,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:11:30,194 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:11:30,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30 WrapperNode [2019-10-13 19:11:30,195 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:11:30,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:11:30,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:11:30,196 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:11:30,207 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... [2019-10-13 19:11:30,207 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... [2019-10-13 19:11:30,224 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... [2019-10-13 19:11:30,224 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... [2019-10-13 19:11:30,241 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... [2019-10-13 19:11:30,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... [2019-10-13 19:11:30,250 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... [2019-10-13 19:11:30,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:11:30,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:11:30,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:11:30,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:11:30,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:11:30,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:11:30,316 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:11:30,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 19:11:30,316 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 19:11:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-13 19:11:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-13 19:11:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-13 19:11:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 19:11:30,317 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:11:30,317 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:11:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:11:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 19:11:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 19:11:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 19:11:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 19:11:30,318 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 19:11:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 19:11:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 19:11:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 19:11:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 19:11:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 19:11:30,319 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 19:11:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 19:11:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 19:11:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 19:11:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 19:11:30,320 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 19:11:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 19:11:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 19:11:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-13 19:11:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-13 19:11:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-13 19:11:30,321 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 19:11:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 19:11:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 19:11:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 19:11:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 19:11:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 19:11:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 19:11:30,322 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 19:11:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 19:11:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 19:11:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 19:11:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 19:11:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 19:11:30,323 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 19:11:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 19:11:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 19:11:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 19:11:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 19:11:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 19:11:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 19:11:30,324 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 19:11:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 19:11:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 19:11:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 19:11:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 19:11:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 19:11:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 19:11:30,325 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 19:11:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 19:11:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 19:11:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 19:11:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 19:11:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 19:11:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 19:11:30,326 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:11:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 19:11:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 19:11:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 19:11:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 19:11:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 19:11:30,327 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 19:11:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 19:11:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 19:11:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 19:11:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 19:11:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 19:11:30,328 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 19:11:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 19:11:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 19:11:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 19:11:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 19:11:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 19:11:30,329 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 19:11:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 19:11:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 19:11:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 19:11:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 19:11:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 19:11:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 19:11:30,330 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 19:11:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 19:11:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 19:11:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 19:11:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 19:11:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 19:11:30,331 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 19:11:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 19:11:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 19:11:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 19:11:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 19:11:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 19:11:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 19:11:30,332 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 19:11:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 19:11:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 19:11:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 19:11:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 19:11:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 19:11:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 19:11:30,333 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 19:11:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 19:11:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 19:11:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 19:11:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 19:11:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 19:11:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 19:11:30,334 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 19:11:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:11:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:11:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 19:11:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 19:11:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 19:11:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 19:11:30,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:11:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:11:30,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:11:30,714 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 19:11:30,872 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:11:30,873 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 19:11:30,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:11:30 BoogieIcfgContainer [2019-10-13 19:11:30,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:11:30,876 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:11:30,876 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:11:30,879 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:11:30,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:11:29" (1/3) ... [2019-10-13 19:11:30,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6677a9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:11:30, skipping insertion in model container [2019-10-13 19:11:30,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:11:30" (2/3) ... [2019-10-13 19:11:30,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6677a9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:11:30, skipping insertion in model container [2019-10-13 19:11:30,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:11:30" (3/3) ... [2019-10-13 19:11:30,882 INFO L109 eAbstractionObserver]: Analyzing ICFG list-ext_flag.i [2019-10-13 19:11:30,891 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:11:30,899 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:11:30,910 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:11:30,934 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:11:30,935 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:11:30,935 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:11:30,935 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:11:30,936 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:11:30,936 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:11:30,936 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:11:30,936 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:11:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2019-10-13 19:11:30,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 19:11:30,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:30,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:30,961 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:30,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:30,967 INFO L82 PathProgramCache]: Analyzing trace with hash -10426518, now seen corresponding path program 1 times [2019-10-13 19:11:30,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:30,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190613983] [2019-10-13 19:11:30,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:30,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:30,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:31,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:31,201 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190613983] [2019-10-13 19:11:31,202 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:31,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:11:31,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287561402] [2019-10-13 19:11:31,208 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:11:31,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:31,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:11:31,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:11:31,231 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2019-10-13 19:11:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:31,377 INFO L93 Difference]: Finished difference Result 55 states and 75 transitions. [2019-10-13 19:11:31,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:11:31,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 19:11:31,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:31,389 INFO L225 Difference]: With dead ends: 55 [2019-10-13 19:11:31,389 INFO L226 Difference]: Without dead ends: 26 [2019-10-13 19:11:31,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:11:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-13 19:11:31,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-10-13 19:11:31,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-13 19:11:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-10-13 19:11:31,462 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2019-10-13 19:11:31,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:31,462 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-10-13 19:11:31,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:11:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-10-13 19:11:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:11:31,465 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:31,465 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:31,465 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:31,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:31,466 INFO L82 PathProgramCache]: Analyzing trace with hash -166897896, now seen corresponding path program 1 times [2019-10-13 19:11:31,467 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:31,467 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765602160] [2019-10-13 19:11:31,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:31,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:31,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:31,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:31,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765602160] [2019-10-13 19:11:31,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:31,657 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 19:11:31,657 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987239521] [2019-10-13 19:11:31,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:11:31,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:11:31,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:11:31,659 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 8 states. [2019-10-13 19:11:31,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:31,766 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-10-13 19:11:31,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 19:11:31,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-10-13 19:11:31,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:31,768 INFO L225 Difference]: With dead ends: 42 [2019-10-13 19:11:31,768 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 19:11:31,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:11:31,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 19:11:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-10-13 19:11:31,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 19:11:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-10-13 19:11:31,776 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 17 [2019-10-13 19:11:31,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:31,777 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-10-13 19:11:31,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:11:31,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-10-13 19:11:31,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 19:11:31,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:31,778 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:31,779 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:31,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash -166856170, now seen corresponding path program 1 times [2019-10-13 19:11:31,779 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:31,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479003125] [2019-10-13 19:11:31,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:31,780 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:31,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:31,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:31,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479003125] [2019-10-13 19:11:31,881 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:11:31,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 19:11:31,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427825659] [2019-10-13 19:11:31,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 19:11:31,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:31,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 19:11:31,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:11:31,883 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 6 states. [2019-10-13 19:11:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:32,003 INFO L93 Difference]: Finished difference Result 60 states and 76 transitions. [2019-10-13 19:11:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:11:32,004 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-10-13 19:11:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:32,005 INFO L225 Difference]: With dead ends: 60 [2019-10-13 19:11:32,005 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 19:11:32,006 INFO L600 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-10-13 19:11:32,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 19:11:32,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2019-10-13 19:11:32,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-13 19:11:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-10-13 19:11:32,012 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 17 [2019-10-13 19:11:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:32,013 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-13 19:11:32,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 19:11:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-10-13 19:11:32,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:11:32,014 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:32,014 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:32,014 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:32,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:32,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1985042728, now seen corresponding path program 1 times [2019-10-13 19:11:32,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:32,015 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240669078] [2019-10-13 19:11:32,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:32,015 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:32,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:32,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240669078] [2019-10-13 19:11:32,233 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45329739] [2019-10-13 19:11:32,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:32,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 19:11:32,361 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:32,421 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:32,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:32,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:11:32,447 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-10-13 19:11:32,448 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,455 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:32,456 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,456 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-13 19:11:32,470 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:32,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:32,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:32,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,481 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-13 19:11:32,500 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:32,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-10-13 19:11:32,502 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:32,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-13 19:11:32,544 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-10-13 19:11:32,545 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,586 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:32,587 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-10-13 19:11:32,587 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-13 19:11:32,632 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-10-13 19:11:32,633 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,638 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:32,638 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:32,639 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-13 19:11:32,643 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:32,643 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:32,644 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-13 19:11:32,644 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157469725] [2019-10-13 19:11:32,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:11:32,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:32,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:11:32,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:11:32,645 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 12 states. [2019-10-13 19:11:33,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:33,035 INFO L93 Difference]: Finished difference Result 80 states and 98 transitions. [2019-10-13 19:11:33,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:11:33,037 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-13 19:11:33,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:33,042 INFO L225 Difference]: With dead ends: 80 [2019-10-13 19:11:33,042 INFO L226 Difference]: Without dead ends: 78 [2019-10-13 19:11:33,043 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:11:33,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-13 19:11:33,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2019-10-13 19:11:33,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-10-13 19:11:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2019-10-13 19:11:33,053 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 24 [2019-10-13 19:11:33,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:33,054 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2019-10-13 19:11:33,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:11:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2019-10-13 19:11:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:11:33,055 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:33,055 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:33,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:33,261 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:33,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:33,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1985035784, now seen corresponding path program 1 times [2019-10-13 19:11:33,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:33,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537146777] [2019-10-13 19:11:33,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:33,264 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:33,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:33,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:33,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:33,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537146777] [2019-10-13 19:11:33,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [534849234] [2019-10-13 19:11:33,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:33,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 19:11:33,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:33,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:33,588 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,590 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:11:33,624 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:11:33,624 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,637 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,637 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-10-13 19:11:33,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:33,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2019-10-13 19:11:33,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-13 19:11:33,736 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,737 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:33,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,748 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-10-13 19:11:33,797 INFO L341 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2019-10-13 19:11:33,797 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2019-10-13 19:11:33,798 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,805 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,806 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2019-10-13 19:11:33,846 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-13 19:11:33,846 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 29 treesize of output 31 [2019-10-13 19:11:33,847 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,861 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-10-13 19:11:33,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:33, output treesize:29 [2019-10-13 19:11:33,908 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-13 19:11:33,909 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 1 case distinctions, treesize of input 34 treesize of output 14 [2019-10-13 19:11:33,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,916 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:33,917 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:33,917 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:4 [2019-10-13 19:11:33,920 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:33,920 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:33,921 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-13 19:11:33,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713433957] [2019-10-13 19:11:33,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 19:11:33,922 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:33,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 19:11:33,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:11:33,923 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand 18 states. [2019-10-13 19:11:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:34,502 INFO L93 Difference]: Finished difference Result 108 states and 136 transitions. [2019-10-13 19:11:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:11:34,503 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-13 19:11:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:34,504 INFO L225 Difference]: With dead ends: 108 [2019-10-13 19:11:34,504 INFO L226 Difference]: Without dead ends: 98 [2019-10-13 19:11:34,505 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=464, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:11:34,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-13 19:11:34,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 64. [2019-10-13 19:11:34,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-10-13 19:11:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 82 transitions. [2019-10-13 19:11:34,516 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 82 transitions. Word has length 24 [2019-10-13 19:11:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:34,516 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 82 transitions. [2019-10-13 19:11:34,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 19:11:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 82 transitions. [2019-10-13 19:11:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:11:34,518 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:34,518 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:34,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:34,722 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:34,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1500536216, now seen corresponding path program 1 times [2019-10-13 19:11:34,723 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:34,723 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812509498] [2019-10-13 19:11:34,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:34,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:34,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:34,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:34,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:34,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812509498] [2019-10-13 19:11:34,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210290351] [2019-10-13 19:11:34,836 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-10-13 19:11:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:34,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:11:34,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:34,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:35,010 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:35,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-13 19:11:35,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104223961] [2019-10-13 19:11:35,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:11:35,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:35,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:11:35,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:11:35,012 INFO L87 Difference]: Start difference. First operand 64 states and 82 transitions. Second operand 12 states. [2019-10-13 19:11:35,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:35,284 INFO L93 Difference]: Finished difference Result 151 states and 194 transitions. [2019-10-13 19:11:35,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-13 19:11:35,284 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-13 19:11:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:35,285 INFO L225 Difference]: With dead ends: 151 [2019-10-13 19:11:35,286 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 19:11:35,286 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:11:35,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 19:11:35,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2019-10-13 19:11:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-10-13 19:11:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2019-10-13 19:11:35,296 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 24 [2019-10-13 19:11:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:35,296 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2019-10-13 19:11:35,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:11:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2019-10-13 19:11:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:11:35,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:35,298 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:35,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:35,510 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1723118554, now seen corresponding path program 1 times [2019-10-13 19:11:35,510 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:35,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711056888] [2019-10-13 19:11:35,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:35,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:35,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:35,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:35,716 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:35,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711056888] [2019-10-13 19:11:35,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761295359] [2019-10-13 19:11:35,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:35,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 19:11:35,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:35,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:35,820 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,825 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:35,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,826 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:11:35,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:11:35,878 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:35,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:21 [2019-10-13 19:11:35,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:35,917 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 21 treesize of output 20 [2019-10-13 19:11:35,917 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:35,927 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-10-13 19:11:35,963 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:35,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:35,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,975 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:35,976 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:35,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-10-13 19:11:36,061 INFO L341 Elim1Store]: treesize reduction 68, result has 20.0 percent of original size [2019-10-13 19:11:36,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 23 [2019-10-13 19:11:36,063 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:36,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:36,070 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:36,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:21 [2019-10-13 19:11:36,096 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-13 19:11:36,097 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 28 treesize of output 30 [2019-10-13 19:11:36,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:36,105 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:36,105 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-10-13 19:11:36,106 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-10-13 19:11:36,144 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-10-13 19:11:36,145 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 1 case distinctions, treesize of input 33 treesize of output 13 [2019-10-13 19:11:36,145 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:36,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:36,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:36,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2019-10-13 19:11:36,152 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:36,152 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:36,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2019-10-13 19:11:36,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210191246] [2019-10-13 19:11:36,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 19:11:36,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:36,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 19:11:36,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:11:36,154 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand 18 states. [2019-10-13 19:11:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:36,603 INFO L93 Difference]: Finished difference Result 117 states and 146 transitions. [2019-10-13 19:11:36,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 19:11:36,603 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 24 [2019-10-13 19:11:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:36,604 INFO L225 Difference]: With dead ends: 117 [2019-10-13 19:11:36,604 INFO L226 Difference]: Without dead ends: 97 [2019-10-13 19:11:36,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2019-10-13 19:11:36,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2019-10-13 19:11:36,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 80. [2019-10-13 19:11:36,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 19:11:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 97 transitions. [2019-10-13 19:11:36,614 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 97 transitions. Word has length 24 [2019-10-13 19:11:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:36,614 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 97 transitions. [2019-10-13 19:11:36,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 19:11:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 97 transitions. [2019-10-13 19:11:36,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 19:11:36,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:36,615 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:36,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:36,828 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:36,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1723125498, now seen corresponding path program 1 times [2019-10-13 19:11:36,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:36,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372885842] [2019-10-13 19:11:36,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:36,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:36,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:36,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:36,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:36,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372885842] [2019-10-13 19:11:36,957 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [818380029] [2019-10-13 19:11:36,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:37,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-13 19:11:37,057 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:37,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:37,071 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,074 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:11:37,083 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-10-13 19:11:37,083 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-10-13 19:11:37,103 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:37,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2019-10-13 19:11:37,126 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:37,126 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-10-13 19:11:37,127 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-10-13 19:11:37,156 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-10-13 19:11:37,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,163 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,164 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-10-13 19:11:37,165 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-10-13 19:11:37,191 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-10-13 19:11:37,192 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:37,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:37,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-13 19:11:37,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:37,198 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:37,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2019-10-13 19:11:37,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065573808] [2019-10-13 19:11:37,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 19:11:37,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 19:11:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-13 19:11:37,200 INFO L87 Difference]: Start difference. First operand 80 states and 97 transitions. Second operand 12 states. [2019-10-13 19:11:37,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:37,590 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2019-10-13 19:11:37,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:11:37,591 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-13 19:11:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:37,592 INFO L225 Difference]: With dead ends: 106 [2019-10-13 19:11:37,592 INFO L226 Difference]: Without dead ends: 104 [2019-10-13 19:11:37,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:11:37,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-13 19:11:37,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 80. [2019-10-13 19:11:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 19:11:37,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 96 transitions. [2019-10-13 19:11:37,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 96 transitions. Word has length 24 [2019-10-13 19:11:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:37,602 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 96 transitions. [2019-10-13 19:11:37,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 19:11:37,602 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2019-10-13 19:11:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-13 19:11:37,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:37,603 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:37,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:37,807 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:37,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1282584101, now seen corresponding path program 1 times [2019-10-13 19:11:37,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:37,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278965267] [2019-10-13 19:11:37,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:37,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:37,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:37,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:37,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:37,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278965267] [2019-10-13 19:11:37,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1436771919] [2019-10-13 19:11:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:38,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:38,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-13 19:11:38,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:38,044 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:38,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,046 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,046 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,046 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-13 19:11:38,077 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:38,078 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,083 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,083 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-13 19:11:38,102 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-10-13 19:11:38,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,118 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-10-13 19:11:38,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,129 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,129 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,130 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-10-13 19:11:38,158 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 2=[|v_#memory_$Pointer$.offset_17|, |v_#memory_$Pointer$.base_21|]} [2019-10-13 19:11:38,163 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-10-13 19:11:38,164 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,176 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2019-10-13 19:11:38,181 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,188 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,212 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2019-10-13 19:11:38,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:38,215 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,225 INFO L567 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2019-10-13 19:11:38,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,226 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-10-13 19:11:38,261 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-10-13 19:11:38,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,270 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-10-13 19:11:38,271 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,279 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2019-10-13 19:11:38,282 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 19:11:38,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:38,284 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:38,284 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-13 19:11:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:38,287 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:38,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2019-10-13 19:11:38,288 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24246792] [2019-10-13 19:11:38,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-13 19:11:38,289 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:38,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-13 19:11:38,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-10-13 19:11:38,289 INFO L87 Difference]: Start difference. First operand 80 states and 96 transitions. Second operand 15 states. [2019-10-13 19:11:38,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:38,674 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2019-10-13 19:11:38,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:11:38,674 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 29 [2019-10-13 19:11:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:38,676 INFO L225 Difference]: With dead ends: 106 [2019-10-13 19:11:38,676 INFO L226 Difference]: Without dead ends: 77 [2019-10-13 19:11:38,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 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-10-13 19:11:38,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-10-13 19:11:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 69. [2019-10-13 19:11:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 19:11:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 83 transitions. [2019-10-13 19:11:38,683 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 83 transitions. Word has length 29 [2019-10-13 19:11:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:38,684 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 83 transitions. [2019-10-13 19:11:38,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-13 19:11:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 83 transitions. [2019-10-13 19:11:38,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:11:38,685 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:38,685 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:38,893 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:38,894 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:38,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:38,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1529316394, now seen corresponding path program 2 times [2019-10-13 19:11:38,896 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:38,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278613426] [2019-10-13 19:11:38,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:38,897 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:38,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:39,115 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:39,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278613426] [2019-10-13 19:11:39,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80355065] [2019-10-13 19:11:39,116 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:39,235 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:11:39,235 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:39,237 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-13 19:11:39,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:39,254 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:39,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,268 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:39,277 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-10-13 19:11:39,277 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,286 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,286 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 19:11:39,304 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,305 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:11:39,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,339 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-13 19:11:39,340 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,340 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-13 19:11:39,380 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:39,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, 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-10-13 19:11:39,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,392 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,392 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-13 19:11:39,421 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 21 treesize of output 20 [2019-10-13 19:11:39,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,433 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,434 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,434 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-10-13 19:11:39,447 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-10-13 19:11:39,447 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-13 19:11:39,500 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,501 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:11:39,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-10-13 19:11:39,550 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:39,550 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-10-13 19:11:39,551 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,562 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-10-13 19:11:39,562 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-13 19:11:39,597 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-10-13 19:11:39,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,610 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,611 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-10-13 19:11:39,611 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2019-10-13 19:11:39,651 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-10-13 19:11:39,652 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,657 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:39,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:39,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2019-10-13 19:11:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:39,664 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:39,664 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 20 [2019-10-13 19:11:39,665 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791755156] [2019-10-13 19:11:39,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 19:11:39,665 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:39,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 19:11:39,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:11:39,666 INFO L87 Difference]: Start difference. First operand 69 states and 83 transitions. Second operand 20 states. [2019-10-13 19:11:40,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:40,497 INFO L93 Difference]: Finished difference Result 136 states and 165 transitions. [2019-10-13 19:11:40,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 19:11:40,498 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-10-13 19:11:40,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:40,499 INFO L225 Difference]: With dead ends: 136 [2019-10-13 19:11:40,499 INFO L226 Difference]: Without dead ends: 134 [2019-10-13 19:11:40,500 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=208, Invalid=722, Unknown=0, NotChecked=0, Total=930 [2019-10-13 19:11:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-13 19:11:40,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 93. [2019-10-13 19:11:40,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-13 19:11:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 114 transitions. [2019-10-13 19:11:40,509 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 114 transitions. Word has length 31 [2019-10-13 19:11:40,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:40,510 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 114 transitions. [2019-10-13 19:11:40,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 19:11:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 114 transitions. [2019-10-13 19:11:40,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:11:40,511 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:40,511 INFO L380 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] [2019-10-13 19:11:40,716 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:40,717 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:40,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1948002452, now seen corresponding path program 1 times [2019-10-13 19:11:40,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:40,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465835345] [2019-10-13 19:11:40,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:40,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:40,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:40,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:40,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465835345] [2019-10-13 19:11:40,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398757419] [2019-10-13 19:11:40,982 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-10-13 19:11:41,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:41,083 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 46 conjunts are in the unsatisfiable core [2019-10-13 19:11:41,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:41,090 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:41,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,094 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:41,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:11:41,102 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,114 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,114 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2019-10-13 19:11:41,122 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-10-13 19:11:41,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:41,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:41,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:41,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2019-10-13 19:11:41,133 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,136 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,150 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2019-10-13 19:11:41,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:41,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,194 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,194 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:30 [2019-10-13 19:11:41,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-10-13 19:11:41,228 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,234 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,234 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2019-10-13 19:11:41,259 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-13 19:11:41,260 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,269 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,269 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:35, output treesize:22 [2019-10-13 19:11:41,275 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-13 19:11:41,276 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,284 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,285 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,285 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-10-13 19:11:41,373 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:41,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 41 treesize of output 31 [2019-10-13 19:11:41,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,385 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,386 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-10-13 19:11:41,386 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:32 [2019-10-13 19:11:41,452 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,452 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 78 [2019-10-13 19:11:41,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,494 INFO L567 ElimStorePlain]: treesize reduction 28, result has 63.2 percent of original size [2019-10-13 19:11:41,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,499 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-10-13 19:11:41,499 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:48 [2019-10-13 19:11:41,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,500 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,552 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:41,665 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 0 case distinctions, treesize of input 37 treesize of output 17 [2019-10-13 19:11:41,666 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:41,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:41,671 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:3 [2019-10-13 19:11:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:41,682 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:41,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 22 [2019-10-13 19:11:41,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168632873] [2019-10-13 19:11:41,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 19:11:41,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:41,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 19:11:41,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=379, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:11:41,686 INFO L87 Difference]: Start difference. First operand 93 states and 114 transitions. Second operand 22 states. [2019-10-13 19:11:42,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:42,616 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2019-10-13 19:11:42,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-13 19:11:42,617 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2019-10-13 19:11:42,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:42,618 INFO L225 Difference]: With dead ends: 142 [2019-10-13 19:11:42,618 INFO L226 Difference]: Without dead ends: 128 [2019-10-13 19:11:42,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=238, Invalid=1022, Unknown=0, NotChecked=0, Total=1260 [2019-10-13 19:11:42,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-10-13 19:11:42,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 98. [2019-10-13 19:11:42,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-13 19:11:42,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2019-10-13 19:11:42,635 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 31 [2019-10-13 19:11:42,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:42,636 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2019-10-13 19:11:42,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 19:11:42,636 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2019-10-13 19:11:42,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-13 19:11:42,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:42,642 INFO L380 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] [2019-10-13 19:11:42,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:42,843 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:42,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:42,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1948009396, now seen corresponding path program 1 times [2019-10-13 19:11:42,844 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:42,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048391459] [2019-10-13 19:11:42,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:42,844 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:42,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:43,037 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:43,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048391459] [2019-10-13 19:11:43,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1815225954] [2019-10-13 19:11:43,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:43,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:43,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-13 19:11:43,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:43,172 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:43,172 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:43,186 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-10-13 19:11:43,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 19:11:43,204 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:43,204 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,213 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-10-13 19:11:43,225 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:43,226 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-10-13 19:11:43,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,232 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,232 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-13 19:11:43,237 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 21 treesize of output 20 [2019-10-13 19:11:43,238 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,245 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,245 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:28, output treesize:15 [2019-10-13 19:11:43,250 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-10-13 19:11:43,250 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,257 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 19:11:43,310 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:43,311 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-10-13 19:11:43,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,319 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-10-13 19:11:43,319 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-13 19:11:43,381 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,381 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-10-13 19:11:43,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,422 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-10-13 19:11:43,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,426 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-10-13 19:11:43,426 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-10-13 19:11:43,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:43,601 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-10-13 19:11:43,602 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:43,605 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:43,605 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2019-10-13 19:11:43,610 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:43,610 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:43,610 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 20 [2019-10-13 19:11:43,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739983776] [2019-10-13 19:11:43,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 19:11:43,611 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:43,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 19:11:43,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:11:43,612 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand 20 states. [2019-10-13 19:11:44,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:44,460 INFO L93 Difference]: Finished difference Result 143 states and 172 transitions. [2019-10-13 19:11:44,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 19:11:44,461 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2019-10-13 19:11:44,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:44,462 INFO L225 Difference]: With dead ends: 143 [2019-10-13 19:11:44,463 INFO L226 Difference]: Without dead ends: 141 [2019-10-13 19:11:44,464 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=1077, Unknown=0, NotChecked=0, Total=1332 [2019-10-13 19:11:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-13 19:11:44,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 99. [2019-10-13 19:11:44,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-10-13 19:11:44,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 121 transitions. [2019-10-13 19:11:44,471 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 121 transitions. Word has length 31 [2019-10-13 19:11:44,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:44,471 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 121 transitions. [2019-10-13 19:11:44,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 19:11:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 121 transitions. [2019-10-13 19:11:44,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:11:44,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:44,473 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:44,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:44,677 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:44,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:44,678 INFO L82 PathProgramCache]: Analyzing trace with hash 935086055, now seen corresponding path program 2 times [2019-10-13 19:11:44,678 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:44,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923978232] [2019-10-13 19:11:44,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:44,679 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:44,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:44,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:44,977 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:44,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923978232] [2019-10-13 19:11:44,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611453078] [2019-10-13 19:11:44,978 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 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-10-13 19:11:45,090 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:11:45,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:45,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-13 19:11:45,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:45,104 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:45,104 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,110 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,110 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:45,133 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,134 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:11:45,134 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,159 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-13 19:11:45,159 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,160 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-13 19:11:45,199 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-10-13 19:11:45,200 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,218 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-10-13 19:11:45,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,232 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,233 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,233 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2019-10-13 19:11:45,291 INFO L341 Elim1Store]: treesize reduction 25, result has 40.5 percent of original size [2019-10-13 19:11:45,292 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 30 [2019-10-13 19:11:45,292 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,322 INFO L567 ElimStorePlain]: treesize reduction 10, result has 83.6 percent of original size [2019-10-13 19:11:45,325 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-13 19:11:45,326 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,337 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:32 [2019-10-13 19:11:45,367 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_52|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_22|]} [2019-10-13 19:11:45,371 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-10-13 19:11:45,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,390 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,411 INFO L341 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2019-10-13 19:11:45,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 28 [2019-10-13 19:11:45,412 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,445 INFO L567 ElimStorePlain]: treesize reduction 8, result has 87.1 percent of original size [2019-10-13 19:11:45,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-13 19:11:45,449 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,463 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:81, output treesize:39 [2019-10-13 19:11:45,509 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:11:45,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,523 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,524 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,524 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:37 [2019-10-13 19:11:45,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,581 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 138 treesize of output 136 [2019-10-13 19:11:45,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:45,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,583 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 19:11:45,647 INFO L567 ElimStorePlain]: treesize reduction 141, result has 49.5 percent of original size [2019-10-13 19:11:45,652 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 130 treesize of output 108 [2019-10-13 19:11:45,653 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,675 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:45,687 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-10-13 19:11:45,688 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,713 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,714 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,714 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:84 [2019-10-13 19:11:45,755 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_24|, |v_#memory_int_54|], 6=[|v_#memory_$Pointer$.base_30|]} [2019-10-13 19:11:45,775 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,775 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 209 treesize of output 199 [2019-10-13 19:11:45,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:45,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-10-13 19:11:45,847 INFO L567 ElimStorePlain]: treesize reduction 334, result has 32.9 percent of original size [2019-10-13 19:11:45,853 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 152 treesize of output 137 [2019-10-13 19:11:45,854 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,875 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,925 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:45,925 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-10-13 19:11:45,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:45,929 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:45,982 INFO L567 ElimStorePlain]: treesize reduction 134, result has 39.6 percent of original size [2019-10-13 19:11:45,983 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-10-13 19:11:45,983 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:220, output treesize:88 [2019-10-13 19:11:46,028 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.offset|], 2=[|#memory_$Pointer$.base|]} [2019-10-13 19:11:46,031 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-10-13 19:11:46,031 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:46,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:46,055 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:46,055 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-10-13 19:11:46,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:46,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:46,057 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:46,078 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-13 19:11:46,079 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-10-13 19:11:46,079 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:99, output treesize:19 [2019-10-13 19:11:46,121 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-10-13 19:11:46,122 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:46,125 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:46,125 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:46,125 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-10-13 19:11:46,132 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:46,132 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:46,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 22 [2019-10-13 19:11:46,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693408789] [2019-10-13 19:11:46,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-13 19:11:46,133 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:46,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-13 19:11:46,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2019-10-13 19:11:46,134 INFO L87 Difference]: Start difference. First operand 99 states and 121 transitions. Second operand 22 states. [2019-10-13 19:11:46,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:46,987 INFO L93 Difference]: Finished difference Result 147 states and 174 transitions. [2019-10-13 19:11:46,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 19:11:46,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 36 [2019-10-13 19:11:46,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:46,988 INFO L225 Difference]: With dead ends: 147 [2019-10-13 19:11:46,988 INFO L226 Difference]: Without dead ends: 145 [2019-10-13 19:11:46,989 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=795, Unknown=0, NotChecked=0, Total=930 [2019-10-13 19:11:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-13 19:11:46,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 116. [2019-10-13 19:11:46,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-10-13 19:11:46,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2019-10-13 19:11:46,997 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 36 [2019-10-13 19:11:46,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:46,998 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2019-10-13 19:11:46,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-13 19:11:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2019-10-13 19:11:46,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:11:46,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:46,999 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:47,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:47,200 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:47,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:47,201 INFO L82 PathProgramCache]: Analyzing trace with hash 935092999, now seen corresponding path program 1 times [2019-10-13 19:11:47,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:47,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512824049] [2019-10-13 19:11:47,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:47,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:47,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:47,792 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:47,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512824049] [2019-10-13 19:11:47,793 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459419857] [2019-10-13 19:11:47,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-13 19:11:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:47,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-13 19:11:47,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:47,924 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:47,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,928 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,928 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,928 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:47,939 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:47,940 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,946 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-13 19:11:47,976 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-10-13 19:11:47,976 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:47,989 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:47,994 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-10-13 19:11:47,995 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,005 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,006 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,006 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-13 19:11:48,035 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.base_32|]} [2019-10-13 19:11:48,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:11:48,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,075 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,077 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2019-10-13 19:11:48,078 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,107 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 35 treesize of output 15 [2019-10-13 19:11:48,107 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,122 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:93, output treesize:42 [2019-10-13 19:11:48,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,159 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-10-13 19:11:48,160 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,187 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 22 treesize of output 21 [2019-10-13 19:11:48,188 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,210 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,211 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-10-13 19:11:48,211 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,236 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,237 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:84, output treesize:46 [2019-10-13 19:11:48,326 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_28|], 6=[|v_#memory_int_57|]} [2019-10-13 19:11:48,331 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:11:48,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,344 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 148 treesize of output 126 [2019-10-13 19:11:48,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,416 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.4 percent of original size [2019-10-13 19:11:48,420 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 139 treesize of output 109 [2019-10-13 19:11:48,421 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,447 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,451 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,452 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,453 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:48,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 40 [2019-10-13 19:11:48,455 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,474 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:86 [2019-10-13 19:11:48,518 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_35|], 6=[|v_#memory_$Pointer$.offset_29|, |v_#memory_int_58|]} [2019-10-13 19:11:48,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,537 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 170 treesize of output 178 [2019-10-13 19:11:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:48,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,545 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:48,621 INFO L567 ElimStorePlain]: treesize reduction 58, result has 66.7 percent of original size [2019-10-13 19:11:48,656 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,656 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 102 treesize of output 124 [2019-10-13 19:11:48,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,673 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:48,687 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 45 [2019-10-13 19:11:48,687 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:48,721 INFO L567 ElimStorePlain]: treesize reduction 12, result has 82.1 percent of original size [2019-10-13 19:11:48,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,722 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-10-13 19:11:48,722 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:180, output treesize:68 [2019-10-13 19:11:48,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:48,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,048 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-10-13 19:11:49,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,056 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, v_prenex_4], 1=[|#memory_$Pointer$.offset|, v_prenex_5]} [2019-10-13 19:11:49,059 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 78 treesize of output 58 [2019-10-13 19:11:49,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,094 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,118 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 63 treesize of output 47 [2019-10-13 19:11:49,119 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,154 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 55 treesize of output 43 [2019-10-13 19:11:49,154 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,186 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:49,187 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 44 treesize of output 32 [2019-10-13 19:11:49,188 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,210 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,211 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-13 19:11:49,211 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:142, output treesize:64 [2019-10-13 19:11:49,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:49,344 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 37 [2019-10-13 19:11:49,345 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:49,351 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:49,351 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:49, output treesize:4 [2019-10-13 19:11:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:49,363 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:49,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-10-13 19:11:49,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400489350] [2019-10-13 19:11:49,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 19:11:49,364 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:49,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 19:11:49,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:11:49,364 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand 27 states. [2019-10-13 19:11:50,156 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-13 19:11:50,309 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-10-13 19:11:50,452 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-10-13 19:11:50,675 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-10-13 19:11:50,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:50,988 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2019-10-13 19:11:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 19:11:50,989 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-10-13 19:11:50,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:50,990 INFO L225 Difference]: With dead ends: 145 [2019-10-13 19:11:50,991 INFO L226 Difference]: Without dead ends: 135 [2019-10-13 19:11:50,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 19:11:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-10-13 19:11:50,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 119. [2019-10-13 19:11:50,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-10-13 19:11:51,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 142 transitions. [2019-10-13 19:11:51,000 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 142 transitions. Word has length 36 [2019-10-13 19:11:51,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:51,000 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 142 transitions. [2019-10-13 19:11:51,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 19:11:51,001 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 142 transitions. [2019-10-13 19:11:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:11:51,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:51,002 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:51,205 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:51,206 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:51,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:51,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1059058651, now seen corresponding path program 1 times [2019-10-13 19:11:51,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:51,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383548054] [2019-10-13 19:11:51,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:51,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:51,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:51,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:51,609 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:51,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383548054] [2019-10-13 19:11:51,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352631357] [2019-10-13 19:11:51,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-13 19:11:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:51,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 65 conjunts are in the unsatisfiable core [2019-10-13 19:11:51,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:51,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:51,738 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,741 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,742 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:51,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,753 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:51,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,761 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,762 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-13 19:11:51,788 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-10-13 19:11:51,788 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,805 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-10-13 19:11:51,805 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,816 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-13 19:11:51,867 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_59|], 2=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_31|]} [2019-10-13 19:11:51,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:11:51,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:51,901 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 15 [2019-10-13 19:11:51,902 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:51,922 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2019-10-13 19:11:51,923 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:51,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:51,938 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:93, output treesize:42 [2019-10-13 19:11:51,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:51,978 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 21 treesize of output 20 [2019-10-13 19:11:51,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,002 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,006 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:52,007 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-10-13 19:11:52,007 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,025 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,029 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-10-13 19:11:52,030 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,044 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:83, output treesize:41 [2019-10-13 19:11:52,128 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_33|], 6=[|v_#memory_int_61|]} [2019-10-13 19:11:52,141 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:11:52,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,152 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 147 treesize of output 125 [2019-10-13 19:11:52,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,154 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,205 INFO L567 ElimStorePlain]: treesize reduction 16, result has 90.3 percent of original size [2019-10-13 19:11:52,208 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 138 treesize of output 108 [2019-10-13 19:11:52,209 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,260 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:52,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:52,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:52,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 39 [2019-10-13 19:11:52,267 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,288 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,288 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:157, output treesize:85 [2019-10-13 19:11:52,331 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_40|], 6=[|v_#memory_$Pointer$.offset_34|, |v_#memory_int_62|]} [2019-10-13 19:11:52,347 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 177 [2019-10-13 19:11:52,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:52,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:52,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,354 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:52,408 INFO L567 ElimStorePlain]: treesize reduction 58, result has 66.5 percent of original size [2019-10-13 19:11:52,442 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,443 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 101 treesize of output 123 [2019-10-13 19:11:52,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 44 [2019-10-13 19:11:52,472 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,512 INFO L567 ElimStorePlain]: treesize reduction 12, result has 81.8 percent of original size [2019-10-13 19:11:52,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,514 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-10-13 19:11:52,514 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:179, output treesize:67 [2019-10-13 19:11:52,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:52,845 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, v_prenex_6], 1=[|#memory_$Pointer$.offset|, v_prenex_7]} [2019-10-13 19:11:52,851 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 62 treesize of output 46 [2019-10-13 19:11:52,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,884 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,888 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 69 treesize of output 53 [2019-10-13 19:11:52,889 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,918 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:52,924 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 43 treesize of output 31 [2019-10-13 19:11:52,924 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,953 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,958 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:52,958 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 50 treesize of output 38 [2019-10-13 19:11:52,959 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:52,981 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:52,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-13 19:11:52,982 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:132, output treesize:58 [2019-10-13 19:11:53,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:53,123 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:53,124 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 44 [2019-10-13 19:11:53,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:53,130 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:53,130 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:53,131 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:44, output treesize:3 [2019-10-13 19:11:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:53,139 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:53,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 27 [2019-10-13 19:11:53,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331656670] [2019-10-13 19:11:53,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 19:11:53,139 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:53,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 19:11:53,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=610, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:11:53,140 INFO L87 Difference]: Start difference. First operand 119 states and 142 transitions. Second operand 27 states. [2019-10-13 19:11:53,933 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-10-13 19:11:54,413 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-13 19:11:54,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:54,744 INFO L93 Difference]: Finished difference Result 155 states and 185 transitions. [2019-10-13 19:11:54,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 19:11:54,744 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 36 [2019-10-13 19:11:54,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:54,745 INFO L225 Difference]: With dead ends: 155 [2019-10-13 19:11:54,745 INFO L226 Difference]: Without dead ends: 145 [2019-10-13 19:11:54,746 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2019-10-13 19:11:54,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-13 19:11:54,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 124. [2019-10-13 19:11:54,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-13 19:11:54,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-10-13 19:11:54,753 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 36 [2019-10-13 19:11:54,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:54,753 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-10-13 19:11:54,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 19:11:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-10-13 19:11:54,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-13 19:11:54,754 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:54,754 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:54,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:54,959 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1059051707, now seen corresponding path program 1 times [2019-10-13 19:11:54,960 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:54,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725074023] [2019-10-13 19:11:54,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:54,960 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:54,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:54,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:55,226 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:55,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725074023] [2019-10-13 19:11:55,226 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822808540] [2019-10-13 19:11:55,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-10-13 19:11:55,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:55,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-13 19:11:55,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:55,373 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:55,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:55,385 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 19:11:55,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,394 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,395 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,395 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-10-13 19:11:55,429 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-10-13 19:11:55,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,440 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,444 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-10-13 19:11:55,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,455 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:33 [2019-10-13 19:11:55,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:55,489 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 14 [2019-10-13 19:11:55,489 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:55,508 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 35 treesize of output 15 [2019-10-13 19:11:55,508 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:29 [2019-10-13 19:11:55,536 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_63|], 2=[|v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.base_43|]} [2019-10-13 19:11:55,540 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-10-13 19:11:55,541 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,562 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:55,563 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-10-13 19:11:55,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:55,583 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-10-13 19:11:55,584 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,594 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,594 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:74, output treesize:32 [2019-10-13 19:11:55,658 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 129 treesize of output 103 [2019-10-13 19:11:55,658 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,691 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,692 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 88 treesize of output 74 [2019-10-13 19:11:55,692 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:55,693 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,728 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.9 percent of original size [2019-10-13 19:11:55,738 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-10-13 19:11:55,738 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,751 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,752 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,752 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:140, output treesize:52 [2019-10-13 19:11:55,791 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_45|, |v_#memory_int_65|], 5=[|v_#memory_$Pointer$.offset_39|]} [2019-10-13 19:11:55,811 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 118 [2019-10-13 19:11:55,812 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:55,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:55,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:55,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:11:55,816 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:55,861 INFO L567 ElimStorePlain]: treesize reduction 40, result has 64.9 percent of original size [2019-10-13 19:11:55,876 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 38 [2019-10-13 19:11:55,877 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,923 INFO L567 ElimStorePlain]: treesize reduction 12, result has 86.0 percent of original size [2019-10-13 19:11:55,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,960 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 2 case distinctions, treesize of input 49 treesize of output 98 [2019-10-13 19:11:55,960 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:55,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:55,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:55,977 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-10-13 19:11:55,977 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:122, output treesize:56 [2019-10-13 19:11:55,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,030 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,367 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_9, |#memory_$Pointer$.base|], 1=[|#memory_$Pointer$.offset|, v_prenex_11]} [2019-10-13 19:11:56,371 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 58 treesize of output 46 [2019-10-13 19:11:56,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,401 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 51 treesize of output 39 [2019-10-13 19:11:56,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,428 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 36 treesize of output 24 [2019-10-13 19:11:56,428 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,444 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:56,449 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 43 treesize of output 31 [2019-10-13 19:11:56,449 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-10-13 19:11:56,466 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:110, output treesize:44 [2019-10-13 19:11:56,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:11:56,682 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:56,683 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 37 [2019-10-13 19:11:56,683 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,698 INFO L567 ElimStorePlain]: treesize reduction 8, result has 66.7 percent of original size [2019-10-13 19:11:56,699 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:56,699 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:29, output treesize:3 [2019-10-13 19:11:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:56,706 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:11:56,706 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 26 [2019-10-13 19:11:56,706 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492298490] [2019-10-13 19:11:56,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 19:11:56,707 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:11:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 19:11:56,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2019-10-13 19:11:56,708 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 26 states. [2019-10-13 19:11:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:11:58,615 INFO L93 Difference]: Finished difference Result 166 states and 196 transitions. [2019-10-13 19:11:58,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 19:11:58,615 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 36 [2019-10-13 19:11:58,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:11:58,617 INFO L225 Difference]: With dead ends: 166 [2019-10-13 19:11:58,617 INFO L226 Difference]: Without dead ends: 164 [2019-10-13 19:11:58,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2019-10-13 19:11:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-13 19:11:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 125. [2019-10-13 19:11:58,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-10-13 19:11:58,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2019-10-13 19:11:58,637 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 36 [2019-10-13 19:11:58,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:11:58,637 INFO L462 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2019-10-13 19:11:58,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 19:11:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2019-10-13 19:11:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:11:58,638 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:11:58,638 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:11:58,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:11:58,850 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:11:58,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:11:58,850 INFO L82 PathProgramCache]: Analyzing trace with hash -467482568, now seen corresponding path program 2 times [2019-10-13 19:11:58,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:11:58,851 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430124146] [2019-10-13 19:11:58,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:11:58,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:11:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:11:59,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:11:59,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430124146] [2019-10-13 19:11:59,238 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121036381] [2019-10-13 19:11:59,239 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 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-10-13 19:11:59,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:11:59,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:11:59,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-13 19:11:59,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:11:59,395 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:11:59,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,399 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,399 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,399 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:11:59,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:11:59,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,421 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,421 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,422 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2019-10-13 19:11:59,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2019-10-13 19:11:59,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:59,438 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:59,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:11:59,442 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 17 treesize of output 21 [2019-10-13 19:11:59,443 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,448 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,449 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,461 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:32 [2019-10-13 19:11:59,505 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:11:59,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,537 INFO L567 ElimStorePlain]: treesize reduction 14, result has 74.5 percent of original size [2019-10-13 19:11:59,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:41 [2019-10-13 19:11:59,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2019-10-13 19:11:59,574 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:48, output treesize:33 [2019-10-13 19:11:59,635 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 31 [2019-10-13 19:11:59,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,646 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:46, output treesize:33 [2019-10-13 19:11:59,651 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2019-10-13 19:11:59,651 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,662 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,662 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,663 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2019-10-13 19:11:59,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,707 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:11:59,707 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:38 [2019-10-13 19:11:59,766 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:59,766 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 32 [2019-10-13 19:11:59,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,779 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,779 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-10-13 19:11:59,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:38 [2019-10-13 19:11:59,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 41 [2019-10-13 19:11:59,818 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,835 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:11:59,835 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:51, output treesize:38 [2019-10-13 19:11:59,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2019-10-13 19:11:59,840 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,856 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-10-13 19:11:59,856 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-10-13 19:11:59,956 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:11:59,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 42 [2019-10-13 19:11:59,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:11:59,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:11:59,981 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-10-13 19:11:59,982 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:48 [2019-10-13 19:12:00,107 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 113 [2019-10-13 19:12:00,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,209 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2019-10-13 19:12:00,210 INFO L567 ElimStorePlain]: treesize reduction 44, result has 62.1 percent of original size [2019-10-13 19:12:00,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,216 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-10-13 19:12:00,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:72 [2019-10-13 19:12:00,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,518 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 43 [2019-10-13 19:12:00,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:00,530 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 21 [2019-10-13 19:12:00,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:00,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:00,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:57, output treesize:4 [2019-10-13 19:12:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:00,599 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:00,599 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2019-10-13 19:12:00,599 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707059495] [2019-10-13 19:12:00,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 19:12:00,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:00,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 19:12:00,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2019-10-13 19:12:00,601 INFO L87 Difference]: Start difference. First operand 125 states and 148 transitions. Second operand 28 states. [2019-10-13 19:12:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:01,753 INFO L93 Difference]: Finished difference Result 234 states and 285 transitions. [2019-10-13 19:12:01,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 19:12:01,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-10-13 19:12:01,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:01,756 INFO L225 Difference]: With dead ends: 234 [2019-10-13 19:12:01,756 INFO L226 Difference]: Without dead ends: 220 [2019-10-13 19:12:01,757 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=313, Invalid=1493, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 19:12:01,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-13 19:12:01,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 138. [2019-10-13 19:12:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2019-10-13 19:12:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 163 transitions. [2019-10-13 19:12:01,768 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 163 transitions. Word has length 38 [2019-10-13 19:12:01,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:01,768 INFO L462 AbstractCegarLoop]: Abstraction has 138 states and 163 transitions. [2019-10-13 19:12:01,768 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 19:12:01,768 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 163 transitions. [2019-10-13 19:12:01,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:12:01,769 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:01,769 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:01,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:01,974 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:01,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:01,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1285137962, now seen corresponding path program 2 times [2019-10-13 19:12:01,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:01,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110641292] [2019-10-13 19:12:01,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:01,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:01,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:01,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:02,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:02,246 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:02,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110641292] [2019-10-13 19:12:02,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1373019572] [2019-10-13 19:12:02,246 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-10-13 19:12:02,375 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:02,375 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:02,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-13 19:12:02,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:02,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:02,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,388 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:02,395 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-10-13 19:12:02,395 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,404 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,404 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 19:12:02,422 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,422 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:02,423 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,451 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-13 19:12:02,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-13 19:12:02,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:02,483 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-10-13 19:12:02,484 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-13 19:12:02,514 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 21 treesize of output 20 [2019-10-13 19:12:02,515 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-10-13 19:12:02,531 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-10-13 19:12:02,531 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,541 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,541 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,541 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-13 19:12:02,580 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,580 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:12:02,581 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,592 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,592 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-10-13 19:12:02,625 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:12:02,626 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-10-13 19:12:02,626 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,636 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-10-13 19:12:02,636 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-13 19:12:02,665 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 28 treesize of output 30 [2019-10-13 19:12:02,665 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,680 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:02,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:30 [2019-10-13 19:12:02,685 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-10-13 19:12:02,685 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,698 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,698 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-10-13 19:12:02,698 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-10-13 19:12:02,789 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:12:02,790 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-10-13 19:12:02,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,805 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-10-13 19:12:02,805 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-10-13 19:12:02,886 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:02,886 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-10-13 19:12:02,887 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:02,983 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-10-13 19:12:02,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,988 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-10-13 19:12:02,988 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-10-13 19:12:02,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:02,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:03,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:03,293 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 41 treesize of output 25 [2019-10-13 19:12:03,294 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:03,337 INFO L567 ElimStorePlain]: treesize reduction 4, result has 93.1 percent of original size [2019-10-13 19:12:03,349 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:03,350 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 37 treesize of output 29 [2019-10-13 19:12:03,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:03,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:03,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:03,366 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:83, output treesize:3 [2019-10-13 19:12:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:03,376 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:03,376 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2019-10-13 19:12:03,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861831022] [2019-10-13 19:12:03,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 19:12:03,377 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:03,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 19:12:03,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=582, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:12:03,377 INFO L87 Difference]: Start difference. First operand 138 states and 163 transitions. Second operand 27 states. [2019-10-13 19:12:04,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:04,724 INFO L93 Difference]: Finished difference Result 210 states and 247 transitions. [2019-10-13 19:12:04,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 19:12:04,724 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 38 [2019-10-13 19:12:04,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:04,726 INFO L225 Difference]: With dead ends: 210 [2019-10-13 19:12:04,726 INFO L226 Difference]: Without dead ends: 208 [2019-10-13 19:12:04,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=331, Invalid=1475, Unknown=0, NotChecked=0, Total=1806 [2019-10-13 19:12:04,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-13 19:12:04,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 122. [2019-10-13 19:12:04,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-10-13 19:12:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 143 transitions. [2019-10-13 19:12:04,736 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 143 transitions. Word has length 38 [2019-10-13 19:12:04,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:04,736 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 143 transitions. [2019-10-13 19:12:04,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 19:12:04,737 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 143 transitions. [2019-10-13 19:12:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:12:04,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:04,737 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:04,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:04,942 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:04,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1455738522, now seen corresponding path program 3 times [2019-10-13 19:12:04,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:04,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556979039] [2019-10-13 19:12:04,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:04,944 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:04,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:05,243 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:05,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556979039] [2019-10-13 19:12:05,244 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782480241] [2019-10-13 19:12:05,244 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 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-10-13 19:12:05,423 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-13 19:12:05,423 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:05,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 71 conjunts are in the unsatisfiable core [2019-10-13 19:12:05,426 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:05,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:05,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,432 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,433 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,433 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:05,440 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-13 19:12:05,440 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,451 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,451 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:24 [2019-10-13 19:12:05,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2019-10-13 19:12:05,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,466 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,467 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,468 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 16 treesize of output 20 [2019-10-13 19:12:05,468 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,473 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,490 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:31 [2019-10-13 19:12:05,533 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,533 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:05,533 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,567 INFO L567 ElimStorePlain]: treesize reduction 14, result has 75.4 percent of original size [2019-10-13 19:12:05,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,568 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:45, output treesize:43 [2019-10-13 19:12:05,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2019-10-13 19:12:05,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,625 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,625 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:50, output treesize:35 [2019-10-13 19:12:05,669 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2019-10-13 19:12:05,669 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,687 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,688 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:35 [2019-10-13 19:12:05,692 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2019-10-13 19:12:05,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,729 INFO L567 ElimStorePlain]: treesize reduction 4, result has 90.5 percent of original size [2019-10-13 19:12:05,729 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,730 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:38 [2019-10-13 19:12:05,763 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:05,772 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:12:05,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,786 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2019-10-13 19:12:05,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,838 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2019-10-13 19:12:05,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,863 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2019-10-13 19:12:05,864 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:05,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-13 19:12:05,907 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,908 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 2 case distinctions, treesize of input 35 treesize of output 48 [2019-10-13 19:12:05,908 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,931 INFO L567 ElimStorePlain]: treesize reduction 16, result has 73.8 percent of original size [2019-10-13 19:12:05,932 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:05,932 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:36 [2019-10-13 19:12:05,940 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:05,940 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 2 case distinctions, treesize of input 33 treesize of output 46 [2019-10-13 19:12:05,941 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:05,963 INFO L567 ElimStorePlain]: treesize reduction 8, result has 83.0 percent of original size [2019-10-13 19:12:05,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:05,964 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-10-13 19:12:06,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 44 treesize of output 57 [2019-10-13 19:12:06,045 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,074 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.2 percent of original size [2019-10-13 19:12:06,074 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-10-13 19:12:06,075 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:54, output treesize:39 [2019-10-13 19:12:06,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 40 treesize of output 112 [2019-10-13 19:12:06,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,217 INFO L567 ElimStorePlain]: treesize reduction 36, result has 63.6 percent of original size [2019-10-13 19:12:06,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,222 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-10-13 19:12:06,222 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:63 [2019-10-13 19:12:06,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:06,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 20 [2019-10-13 19:12:06,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,408 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:06,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:06,409 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:3 [2019-10-13 19:12:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:06,435 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:06,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2019-10-13 19:12:06,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277998698] [2019-10-13 19:12:06,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-13 19:12:06,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:06,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-13 19:12:06,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=633, Unknown=0, NotChecked=0, Total=756 [2019-10-13 19:12:06,436 INFO L87 Difference]: Start difference. First operand 122 states and 143 transitions. Second operand 28 states. [2019-10-13 19:12:07,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:07,597 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2019-10-13 19:12:07,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 19:12:07,597 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 38 [2019-10-13 19:12:07,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:07,598 INFO L225 Difference]: With dead ends: 176 [2019-10-13 19:12:07,599 INFO L226 Difference]: Without dead ends: 162 [2019-10-13 19:12:07,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=254, Invalid=1228, Unknown=0, NotChecked=0, Total=1482 [2019-10-13 19:12:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-10-13 19:12:07,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 124. [2019-10-13 19:12:07,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-10-13 19:12:07,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2019-10-13 19:12:07,609 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 38 [2019-10-13 19:12:07,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:07,609 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2019-10-13 19:12:07,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-13 19:12:07,609 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2019-10-13 19:12:07,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:12:07,610 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:07,610 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:07,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:07,811 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:07,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1455745466, now seen corresponding path program 2 times [2019-10-13 19:12:07,812 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:07,812 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255999704] [2019-10-13 19:12:07,812 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:07,813 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:07,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,031 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:08,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255999704] [2019-10-13 19:12:08,031 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572853433] [2019-10-13 19:12:08,032 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 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-10-13 19:12:08,183 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:08,183 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:08,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-13 19:12:08,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:08,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 19:12:08,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,205 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,205 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:08,215 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-10-13 19:12:08,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,225 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,225 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-13 19:12:08,246 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,247 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 19:12:08,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,275 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-13 19:12:08,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-13 19:12:08,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:08,311 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-10-13 19:12:08,311 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,320 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,320 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,320 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2019-10-13 19:12:08,344 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 21 treesize of output 20 [2019-10-13 19:12:08,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,355 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,355 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:38, output treesize:25 [2019-10-13 19:12:08,359 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-10-13 19:12:08,359 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,370 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:32 [2019-10-13 19:12:08,405 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,406 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 19:12:08,406 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,417 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:37, output treesize:30 [2019-10-13 19:12:08,452 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:12:08,453 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-10-13 19:12:08,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,463 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-10-13 19:12:08,463 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2019-10-13 19:12:08,499 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 28 treesize of output 30 [2019-10-13 19:12:08,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:08,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:43, output treesize:30 [2019-10-13 19:12:08,516 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-10-13 19:12:08,517 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,529 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-10-13 19:12:08,529 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:37 [2019-10-13 19:12:08,598 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-13 19:12:08,598 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-10-13 19:12:08,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,618 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-10-13 19:12:08,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:59, output treesize:40 [2019-10-13 19:12:08,697 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:08,697 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-10-13 19:12:08,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:08,766 INFO L567 ElimStorePlain]: treesize reduction 44, result has 59.3 percent of original size [2019-10-13 19:12:08,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,771 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-10-13 19:12:08,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:48, output treesize:64 [2019-10-13 19:12:08,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:08,937 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:09,006 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-10-13 19:12:09,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:09,013 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:09,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:09,014 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:3 [2019-10-13 19:12:09,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:09,023 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:09,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 27 [2019-10-13 19:12:09,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478221276] [2019-10-13 19:12:09,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 19:12:09,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:09,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 19:12:09,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:12:09,024 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand 27 states.