java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:00:42,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:00:42,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:00:42,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:00:42,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:00:42,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:00:42,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:00:42,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:00:42,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:00:42,394 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:00:42,395 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:00:42,396 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:00:42,396 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:00:42,397 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:00:42,398 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:00:42,399 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:00:42,400 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:00:42,403 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:00:42,407 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:00:42,411 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:00:42,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:00:42,418 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:00:42,419 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:00:42,421 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:00:42,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:00:42,425 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:00:42,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:00:42,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:00:42,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:00:42,429 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:00:42,429 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:00:42,430 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:00:42,432 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:00:42,433 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:00:42,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:00:42,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:00:42,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:00:42,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:00:42,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:00:42,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:00:42,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:00:42,440 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-09-20 13:00:42,454 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:00:42,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:00:42,456 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:00:42,456 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:00:42,456 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:00:42,456 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:00:42,457 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:00:42,457 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:00:42,457 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:00:42,457 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:00:42,457 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:00:42,458 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:00:42,458 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:00:42,458 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:00:42,458 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:00:42,458 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:00:42,459 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:00:42,459 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:00:42,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:00:42,459 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:00:42,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:00:42,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:00:42,460 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:00:42,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:00:42,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:00:42,461 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:00:42,461 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:00:42,461 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:00:42,461 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:00:42,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:00:42,508 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:00:42,515 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:00:42,519 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:00:42,519 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:00:42,520 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2019-09-20 13:00:42,595 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6ef0788/ba27f41d089d4956aee87029377fb81a/FLAG4618efeab [2019-09-20 13:00:43,114 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:00:43,115 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2019-09-20 13:00:43,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6ef0788/ba27f41d089d4956aee87029377fb81a/FLAG4618efeab [2019-09-20 13:00:43,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb6ef0788/ba27f41d089d4956aee87029377fb81a [2019-09-20 13:00:43,409 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:00:43,410 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:00:43,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:43,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:00:43,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:00:43,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:43" (1/1) ... [2019-09-20 13:00:43,417 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7041ec30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:43, skipping insertion in model container [2019-09-20 13:00:43,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:00:43" (1/1) ... [2019-09-20 13:00:43,424 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:00:43,479 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:00:43,906 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:43,919 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:00:44,003 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:00:44,061 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:00:44,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44 WrapperNode [2019-09-20 13:00:44,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:00:44,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:00:44,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:00:44,062 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:00:44,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (1/1) ... [2019-09-20 13:00:44,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (1/1) ... [2019-09-20 13:00:44,095 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (1/1) ... [2019-09-20 13:00:44,096 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (1/1) ... [2019-09-20 13:00:44,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (1/1) ... [2019-09-20 13:00:44,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (1/1) ... [2019-09-20 13:00:44,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (1/1) ... [2019-09-20 13:00:44,139 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:00:44,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:00:44,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:00:44,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:00:44,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (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-09-20 13:00:44,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:00:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:00:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:00:44,200 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:00:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-09-20 13:00:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-09-20 13:00:44,201 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-09-20 13:00:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-20 13:00:44,202 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:00:44,202 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:00:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:00:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:00:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:00:44,203 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:00:44,204 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:00:44,205 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:00:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:00:44,207 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:00:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:00:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:00:44,208 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:00:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:00:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:00:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:00:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:00:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:00:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:00:44,209 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:00:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:00:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-09-20 13:00:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-09-20 13:00:44,210 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-09-20 13:00:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:00:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:00:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:00:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:00:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:00:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:00:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:00:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:00:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:00:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:00:44,212 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:00:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:00:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:00:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:00:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:00:44,213 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:00:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:00:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:00:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:00:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:00:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:00:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:00:44,214 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:00:44,215 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:00:44,215 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:00:44,215 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:00:44,215 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:00:44,215 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:00:44,215 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:00:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:00:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:00:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:00:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:00:44,216 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:00:44,217 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:00:44,217 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:00:44,218 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:00:44,218 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:00:44,218 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:00:44,218 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:00:44,219 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:00:44,219 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:00:44,220 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:00:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:00:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:00:44,221 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:00:44,222 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:00:44,222 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:00:44,222 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:00:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:00:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:00:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:00:44,223 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:00:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:00:44,224 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:00:44,225 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:00:44,226 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:00:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:00:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:00:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:00:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:00:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:00:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:00:44,227 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:00:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:00:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:00:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:00:44,228 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:00:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-20 13:00:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:00:44,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:00:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:00:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:00:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:00:44,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:00:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:00:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:00:44,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:00:44,617 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-20 13:00:44,796 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:00:44,797 INFO L283 CfgBuilder]: Removed 4 assume(true) statements. [2019-09-20 13:00:44,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:44 BoogieIcfgContainer [2019-09-20 13:00:44,799 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:00:44,800 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:00:44,800 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:00:44,803 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:00:44,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:00:43" (1/3) ... [2019-09-20 13:00:44,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b332f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:44, skipping insertion in model container [2019-09-20 13:00:44,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:00:44" (2/3) ... [2019-09-20 13:00:44,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18b332f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:00:44, skipping insertion in model container [2019-09-20 13:00:44,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:00:44" (3/3) ... [2019-09-20 13:00:44,812 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-2.i [2019-09-20 13:00:44,822 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:00:44,836 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:00:44,862 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:00:44,886 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:00:44,886 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:00:44,887 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:00:44,887 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:00:44,887 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:00:44,887 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:00:44,887 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:00:44,887 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:00:44,887 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:00:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-09-20 13:00:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-09-20 13:00:44,909 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:44,910 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:44,912 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:44,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:44,918 INFO L82 PathProgramCache]: Analyzing trace with hash 661731879, now seen corresponding path program 1 times [2019-09-20 13:00:44,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:44,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:44,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:44,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:44,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:45,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:45,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:45,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:00:45,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:00:45,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:00:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:00:45,106 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-09-20 13:00:45,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:45,142 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-09-20 13:00:45,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:00:45,144 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-09-20 13:00:45,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:45,156 INFO L225 Difference]: With dead ends: 54 [2019-09-20 13:00:45,156 INFO L226 Difference]: Without dead ends: 27 [2019-09-20 13:00:45,162 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:00:45,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-09-20 13:00:45,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-09-20 13:00:45,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-20 13:00:45,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-09-20 13:00:45,201 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2019-09-20 13:00:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:45,202 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-09-20 13:00:45,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:00:45,202 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-09-20 13:00:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-20 13:00:45,203 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:45,203 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:45,204 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1973627133, now seen corresponding path program 1 times [2019-09-20 13:00:45,205 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:45,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,210 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:45,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:45,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:45,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:45,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:45,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:45,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:45,376 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 4 states. [2019-09-20 13:00:45,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:45,458 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-09-20 13:00:45,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:45,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-09-20 13:00:45,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:45,460 INFO L225 Difference]: With dead ends: 44 [2019-09-20 13:00:45,461 INFO L226 Difference]: Without dead ends: 37 [2019-09-20 13:00:45,462 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-09-20 13:00:45,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-09-20 13:00:45,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-09-20 13:00:45,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-09-20 13:00:45,469 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-09-20 13:00:45,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:45,470 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-09-20 13:00:45,470 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:45,470 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-09-20 13:00:45,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:00:45,471 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:45,471 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:45,472 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:45,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:45,472 INFO L82 PathProgramCache]: Analyzing trace with hash -1721544590, now seen corresponding path program 1 times [2019-09-20 13:00:45,472 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:45,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:45,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:45,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:45,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:45,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:00:45,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:00:45,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:00:45,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:00:45,607 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 4 states. [2019-09-20 13:00:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:45,668 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-09-20 13:00:45,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:00:45,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-09-20 13:00:45,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:45,671 INFO L225 Difference]: With dead ends: 51 [2019-09-20 13:00:45,671 INFO L226 Difference]: Without dead ends: 43 [2019-09-20 13:00:45,672 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:00:45,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-20 13:00:45,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-20 13:00:45,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-20 13:00:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2019-09-20 13:00:45,680 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2019-09-20 13:00:45,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:45,681 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-09-20 13:00:45,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:00:45,681 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2019-09-20 13:00:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-20 13:00:45,682 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:45,682 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:45,682 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:45,683 INFO L82 PathProgramCache]: Analyzing trace with hash -918584693, now seen corresponding path program 1 times [2019-09-20 13:00:45,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:45,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,690 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:45,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:45,773 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:45,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:45,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:00:45,775 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:00:45,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:00:45,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:00:45,775 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 6 states. [2019-09-20 13:00:45,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:45,904 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2019-09-20 13:00:45,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:00:45,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2019-09-20 13:00:45,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:45,906 INFO L225 Difference]: With dead ends: 74 [2019-09-20 13:00:45,906 INFO L226 Difference]: Without dead ends: 47 [2019-09-20 13:00:45,907 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:00:45,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-20 13:00:45,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-09-20 13:00:45,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-20 13:00:45,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-09-20 13:00:45,913 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2019-09-20 13:00:45,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:45,914 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-09-20 13:00:45,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:00:45,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-09-20 13:00:45,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-20 13:00:45,915 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:45,915 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:45,915 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:45,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:45,916 INFO L82 PathProgramCache]: Analyzing trace with hash -743556192, now seen corresponding path program 1 times [2019-09-20 13:00:45,916 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:45,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:45,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:46,231 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:46,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:46,232 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:46,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:46,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-20 13:00:46,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:46,452 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-09-20 13:00:46,453 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,464 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:46,465 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,465 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:00:46,545 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:00:46,546 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:46,561 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,561 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-20 13:00:46,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:46,616 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-09-20 13:00:46,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:46,630 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,630 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-09-20 13:00:46,666 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:46,668 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-09-20 13:00:46,670 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:46,679 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,680 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-09-20 13:00:46,734 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-09-20 13:00:46,735 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:46,746 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-09-20 13:00:46,746 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-09-20 13:00:46,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:46,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:00:46,927 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:46,943 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:46,944 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-09-20 13:00:46,944 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2019-09-20 13:00:47,009 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-09-20 13:00:47,009 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:47,014 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:47,014 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:47,015 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-09-20 13:00:47,020 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:47,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:47,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 21 [2019-09-20 13:00:47,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-20 13:00:47,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-20 13:00:47,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-09-20 13:00:47,030 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 21 states. [2019-09-20 13:00:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:48,174 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2019-09-20 13:00:48,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-20 13:00:48,175 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 27 [2019-09-20 13:00:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:48,177 INFO L225 Difference]: With dead ends: 129 [2019-09-20 13:00:48,177 INFO L226 Difference]: Without dead ends: 96 [2019-09-20 13:00:48,178 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=230, Invalid=1176, Unknown=0, NotChecked=0, Total=1406 [2019-09-20 13:00:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-09-20 13:00:48,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2019-09-20 13:00:48,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-20 13:00:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-09-20 13:00:48,190 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2019-09-20 13:00:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:48,191 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-09-20 13:00:48,191 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-20 13:00:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-09-20 13:00:48,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:00:48,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:48,193 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:48,193 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:48,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:48,193 INFO L82 PathProgramCache]: Analyzing trace with hash -1592893925, now seen corresponding path program 1 times [2019-09-20 13:00:48,193 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:48,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:48,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:48,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:48,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:48,425 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:48,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:48,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2019-09-20 13:00:48,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:48,550 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-09-20 13:00:48,550 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,561 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:48,566 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-09-20 13:00:48,566 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:48,573 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,573 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-09-20 13:00:48,600 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-09-20 13:00:48,600 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:48,609 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-09-20 13:00:48,610 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,613 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:48,614 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:48,614 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-09-20 13:00:48,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:00:48,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:48,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 9 [2019-09-20 13:00:48,624 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-20 13:00:48,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-20 13:00:48,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:00:48,625 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 9 states. [2019-09-20 13:00:48,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:48,877 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2019-09-20 13:00:48,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:48,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2019-09-20 13:00:48,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:48,879 INFO L225 Difference]: With dead ends: 76 [2019-09-20 13:00:48,879 INFO L226 Difference]: Without dead ends: 68 [2019-09-20 13:00:48,879 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:00:48,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-20 13:00:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-09-20 13:00:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-09-20 13:00:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-09-20 13:00:48,889 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-09-20 13:00:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:48,889 INFO L475 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-09-20 13:00:48,889 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-20 13:00:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-09-20 13:00:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:48,890 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:48,891 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:48,891 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:48,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:48,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1278392056, now seen corresponding path program 2 times [2019-09-20 13:00:48,891 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:48,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:48,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:48,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:48,931 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:00:48,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:00:48,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:00:48,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:00:48,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:00:48,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:00:48,933 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 3 states. [2019-09-20 13:00:48,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:48,961 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2019-09-20 13:00:48,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:00:48,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-09-20 13:00:48,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:48,962 INFO L225 Difference]: With dead ends: 112 [2019-09-20 13:00:48,962 INFO L226 Difference]: Without dead ends: 70 [2019-09-20 13:00:48,963 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:00:48,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-20 13:00:48,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-09-20 13:00:48,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-20 13:00:48,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-09-20 13:00:48,973 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 30 [2019-09-20 13:00:48,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:48,974 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-09-20 13:00:48,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:00:48,974 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-09-20 13:00:48,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-09-20 13:00:48,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:48,975 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:48,975 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:48,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:48,975 INFO L82 PathProgramCache]: Analyzing trace with hash 496615306, now seen corresponding path program 1 times [2019-09-20 13:00:48,976 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:48,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:48,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,978 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:00:48,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:49,322 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:49,323 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:49,323 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:49,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:49,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:49,446 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjunts are in the unsatisfiable core [2019-09-20 13:00:49,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:49,470 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-09-20 13:00:49,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,473 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,473 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-09-20 13:00:49,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,525 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-09-20 13:00:49,526 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,531 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-09-20 13:00:49,563 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-09-20 13:00:49,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,582 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-09-20 13:00:49,582 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,593 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,593 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-09-20 13:00:49,630 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_20|, |v_#memory_$Pointer$.base_21|]} [2019-09-20 13:00:49,637 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-09-20 13:00:49,637 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,649 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,656 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-09-20 13:00:49,657 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,686 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,686 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-09-20 13:00:49,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:49,690 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,703 INFO L567 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2019-09-20 13:00:49,703 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,703 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-09-20 13:00:49,769 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2019-09-20 13:00:49,770 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,778 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-09-20 13:00:49,778 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,784 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,785 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2019-09-20 13:00:49,811 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-09-20 13:00:49,812 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,823 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,824 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-09-20 13:00:49,850 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-09-20 13:00:49,850 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,852 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:49,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:49,852 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-09-20 13:00:49,873 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:49,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:49,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2019-09-20 13:00:49,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-20 13:00:49,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-20 13:00:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=497, Unknown=0, NotChecked=0, Total=552 [2019-09-20 13:00:49,879 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 24 states. [2019-09-20 13:00:51,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:51,114 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-09-20 13:00:51,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:00:51,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2019-09-20 13:00:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:51,115 INFO L225 Difference]: With dead ends: 85 [2019-09-20 13:00:51,115 INFO L226 Difference]: Without dead ends: 64 [2019-09-20 13:00:51,117 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2019-09-20 13:00:51,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-20 13:00:51,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-09-20 13:00:51,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-09-20 13:00:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-09-20 13:00:51,127 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2019-09-20 13:00:51,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:51,127 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-09-20 13:00:51,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-20 13:00:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-09-20 13:00:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-09-20 13:00:51,128 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:51,128 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:51,128 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:51,129 INFO L82 PathProgramCache]: Analyzing trace with hash 748997879, now seen corresponding path program 1 times [2019-09-20 13:00:51,129 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:51,129 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:51,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:51,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:51,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:51,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:51,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:51,460 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:51,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:51,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 53 conjunts are in the unsatisfiable core [2019-09-20 13:00:51,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:51,586 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-09-20 13:00:51,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,599 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,600 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,600 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:00:51,655 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-09-20 13:00:51,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-20 13:00:51,701 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,701 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-09-20 13:00:51,702 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,711 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,712 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-09-20 13:00:51,727 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:51,728 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-09-20 13:00:51,729 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,735 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,736 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-09-20 13:00:51,765 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:51,769 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-09-20 13:00:51,769 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,776 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,776 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,776 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2019-09-20 13:00:51,850 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-20 13:00:51,851 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-09-20 13:00:51,852 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,862 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-09-20 13:00:51,863 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-09-20 13:00:51,932 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:51,933 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-09-20 13:00:51,934 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:51,972 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-09-20 13:00:51,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:51,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:51,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:51,976 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-09-20 13:00:51,976 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-09-20 13:00:51,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:51,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:51,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:52,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:52,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:52,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:52,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:52,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:52,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:00:52,268 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:52,281 INFO L567 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2019-09-20 13:00:52,282 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-09-20 13:00:52,283 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2019-09-20 13:00:52,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:52,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-09-20 13:00:52,367 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:52,375 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-09-20 13:00:52,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:52,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-09-20 13:00:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:52,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:52,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2019-09-20 13:00:52,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-20 13:00:52,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-20 13:00:52,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2019-09-20 13:00:52,388 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 28 states. [2019-09-20 13:00:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:54,643 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-09-20 13:00:54,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-20 13:00:54,644 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 33 [2019-09-20 13:00:54,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:54,645 INFO L225 Difference]: With dead ends: 102 [2019-09-20 13:00:54,645 INFO L226 Difference]: Without dead ends: 94 [2019-09-20 13:00:54,647 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=432, Invalid=2760, Unknown=0, NotChecked=0, Total=3192 [2019-09-20 13:00:54,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-20 13:00:54,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-09-20 13:00:54,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-09-20 13:00:54,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-09-20 13:00:54,659 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 33 [2019-09-20 13:00:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:54,659 INFO L475 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-09-20 13:00:54,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-20 13:00:54,659 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-09-20 13:00:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-20 13:00:54,660 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:54,661 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:54,661 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:54,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -621471021, now seen corresponding path program 1 times [2019-09-20 13:00:54,662 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:54,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:54,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:54,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:55,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:55,184 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:55,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:55,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:55,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-20 13:00:55,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:55,321 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-09-20 13:00:55,321 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,335 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,336 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,336 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:00:55,393 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-09-20 13:00:55,393 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,407 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,408 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-09-20 13:00:55,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,462 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-09-20 13:00:55,463 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,494 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-09-20 13:00:55,495 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,495 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-09-20 13:00:55,532 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_31|]} [2019-09-20 13:00:55,538 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-09-20 13:00:55,539 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,560 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:55,561 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-09-20 13:00:55,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,578 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,579 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2019-09-20 13:00:55,640 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-20 13:00:55,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2019-09-20 13:00:55,642 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,677 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-09-20 13:00:55,682 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-09-20 13:00:55,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,696 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2019-09-20 13:00:55,753 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,754 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-09-20 13:00:55,755 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,771 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,771 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2019-09-20 13:00:55,851 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_25|], 6=[|v_#memory_int_33|]} [2019-09-20 13:00:55,872 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,872 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 99 [2019-09-20 13:00:55,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:00:55,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:55,875 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-09-20 13:00:55,934 INFO L567 ElimStorePlain]: treesize reduction 110, result has 51.3 percent of original size [2019-09-20 13:00:55,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:55,945 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 77 [2019-09-20 13:00:55,946 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:55,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:55,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:00:55,969 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:87 [2019-09-20 13:00:56,088 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:56,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 150 [2019-09-20 13:00:56,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:56,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:56,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,143 INFO L567 ElimStorePlain]: treesize reduction 148, result has 42.0 percent of original size [2019-09-20 13:00:56,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2019-09-20 13:00:56,148 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:56,166 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-09-20 13:00:56,166 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:158, output treesize:91 [2019-09-20 13:00:56,295 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:00:56,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:56,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 49 [2019-09-20 13:00:56,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:56,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:56,307 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:00:56,341 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-09-20 13:00:56,342 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-20 13:00:56,343 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:37 [2019-09-20 13:00:56,401 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:00:56,402 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-09-20 13:00:56,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:56,417 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-09-20 13:00:56,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:37 [2019-09-20 13:00:56,541 INFO L341 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-09-20 13:00:56,542 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 37 [2019-09-20 13:00:56,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,560 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:56,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:00:56,564 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-20 13:00:56,565 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:51 [2019-09-20 13:00:56,680 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-09-20 13:00:56,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,684 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:56,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:56,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-09-20 13:00:56,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:00:56,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:56,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-09-20 13:00:56,700 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-20 13:00:56,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-20 13:00:56,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=937, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:00:56,701 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 33 states. [2019-09-20 13:00:59,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:59,006 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-09-20 13:00:59,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-20 13:00:59,007 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 36 [2019-09-20 13:00:59,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:59,008 INFO L225 Difference]: With dead ends: 124 [2019-09-20 13:00:59,008 INFO L226 Difference]: Without dead ends: 122 [2019-09-20 13:00:59,011 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=452, Invalid=3454, Unknown=0, NotChecked=0, Total=3906 [2019-09-20 13:00:59,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-09-20 13:00:59,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-09-20 13:00:59,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-09-20 13:00:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-09-20 13:00:59,019 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 36 [2019-09-20 13:00:59,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:59,020 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-09-20 13:00:59,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-20 13:00:59,020 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-09-20 13:00:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 13:00:59,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:59,021 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:59,022 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:59,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:59,022 INFO L82 PathProgramCache]: Analyzing trace with hash -234871608, now seen corresponding path program 1 times [2019-09-20 13:00:59,022 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:59,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:59,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:59,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:59,084 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:00:59,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:59,084 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:59,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:59,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:59,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-20 13:00:59,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:59,225 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:00:59,230 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:00:59,230 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 7 [2019-09-20 13:00:59,230 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:00:59,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:00:59,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:00:59,231 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 7 states. [2019-09-20 13:00:59,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:00:59,403 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-09-20 13:00:59,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:00:59,403 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2019-09-20 13:00:59,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:00:59,404 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:00:59,404 INFO L226 Difference]: Without dead ends: 95 [2019-09-20 13:00:59,405 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:00:59,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-20 13:00:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2019-09-20 13:00:59,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-09-20 13:00:59,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-09-20 13:00:59,414 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 38 [2019-09-20 13:00:59,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:00:59,414 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-09-20 13:00:59,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:00:59,414 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-09-20 13:00:59,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 13:00:59,415 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:00:59,415 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:00:59,416 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:00:59,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:00:59,416 INFO L82 PathProgramCache]: Analyzing trace with hash -233161586, now seen corresponding path program 1 times [2019-09-20 13:00:59,416 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:00:59,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:00:59,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:59,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:59,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:00:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:59,691 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:00:59,691 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:00:59,691 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:00:59,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:00:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:00:59,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2019-09-20 13:00:59,814 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:00:59,828 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-09-20 13:00:59,829 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:59,842 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:59,846 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-09-20 13:00:59,846 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:59,857 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:59,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:00:59,857 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-09-20 13:00:59,891 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:59,892 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 48 [2019-09-20 13:00:59,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:59,925 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-09-20 13:00:59,949 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:00:59,949 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 48 [2019-09-20 13:00:59,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:00:59,979 INFO L567 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-09-20 13:00:59,980 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-09-20 13:00:59,980 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:36 [2019-09-20 13:01:00,006 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-09-20 13:01:00,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:00,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:00,018 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-09-20 13:01:00,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:00,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:00,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:00,027 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-09-20 13:01:00,031 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-20 13:01:00,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:00,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 11 [2019-09-20 13:01:00,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:01:00,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:01:00,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:01:00,039 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 11 states. [2019-09-20 13:01:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:00,395 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2019-09-20 13:01:00,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-20 13:01:00,396 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-09-20 13:01:00,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:00,398 INFO L225 Difference]: With dead ends: 101 [2019-09-20 13:01:00,398 INFO L226 Difference]: Without dead ends: 94 [2019-09-20 13:01:00,399 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:01:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-09-20 13:01:00,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2019-09-20 13:01:00,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-09-20 13:01:00,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-09-20 13:01:00,407 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 38 [2019-09-20 13:01:00,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:00,407 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-09-20 13:01:00,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:01:00,407 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-09-20 13:01:00,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-20 13:01:00,408 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:00,408 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:00,408 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:00,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:00,409 INFO L82 PathProgramCache]: Analyzing trace with hash -2076362507, now seen corresponding path program 2 times [2019-09-20 13:01:00,409 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:00,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:00,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:00,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:00,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:01:01,132 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:01,132 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:01,205 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:01:01,256 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:01:01,257 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:01:01,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 69 conjunts are in the unsatisfiable core [2019-09-20 13:01:01,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:01,275 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-09-20 13:01:01,275 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,287 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:01:01,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,344 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-09-20 13:01:01,344 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,372 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-09-20 13:01:01,372 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,373 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-09-20 13:01:01,422 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-09-20 13:01:01,422 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,445 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-09-20 13:01:01,446 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,463 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,464 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,464 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:48 [2019-09-20 13:01:01,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:01,504 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-09-20 13:01:01,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,551 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-09-20 13:01:01,552 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 32 [2019-09-20 13:01:01,552 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,621 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-09-20 13:01:01,622 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,622 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-09-20 13:01:01,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-09-20 13:01:01,671 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:49 [2019-09-20 13:01:01,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-09-20 13:01:01,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,754 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,777 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,777 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 127 [2019-09-20 13:01:01,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:01,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:01,780 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-09-20 13:01:01,844 INFO L567 ElimStorePlain]: treesize reduction 120, result has 48.5 percent of original size [2019-09-20 13:01:01,845 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,845 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:127 [2019-09-20 13:01:01,898 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 6=[|v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_32|]} [2019-09-20 13:01:01,909 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 43 [2019-09-20 13:01:01,910 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:01,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,989 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:01,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 284 [2019-09-20 13:01:01,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:01,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:01,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:01,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:01,996 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-09-20 13:01:02,106 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 42 [2019-09-20 13:01:02,106 INFO L567 ElimStorePlain]: treesize reduction 688, result has 21.4 percent of original size [2019-09-20 13:01:02,110 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:02,136 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:02,136 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 150 [2019-09-20 13:01:02,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,138 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:02,178 INFO L567 ElimStorePlain]: treesize reduction 136, result has 46.2 percent of original size [2019-09-20 13:01:02,179 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:02,179 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:367, output treesize:117 [2019-09-20 13:01:02,342 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_38|], 6=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_33|]} [2019-09-20 13:01:02,398 INFO L341 Elim1Store]: treesize reduction 78, result has 49.0 percent of original size [2019-09-20 13:01:02,399 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 82 [2019-09-20 13:01:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,400 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,401 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:02,473 INFO L567 ElimStorePlain]: treesize reduction 18, result has 88.7 percent of original size [2019-09-20 13:01:02,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:02,492 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 108 [2019-09-20 13:01:02,493 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:02,567 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.1 percent of original size [2019-09-20 13:01:02,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:02,616 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 128 [2019-09-20 13:01:02,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,620 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:02,714 INFO L567 ElimStorePlain]: treesize reduction 62, result has 60.8 percent of original size [2019-09-20 13:01:02,715 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,716 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,717 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,720 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:02,720 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:136, output treesize:153 [2019-09-20 13:01:02,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:02,976 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 52 [2019-09-20 13:01:02,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:02,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2019-09-20 13:01:02,982 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:03,034 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2019-09-20 13:01:03,039 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-09-20 13:01:03,039 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:03,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2019-09-20 13:01:03,044 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:03,070 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:03,071 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-09-20 13:01:03,071 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:170, output treesize:43 [2019-09-20 13:01:03,098 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-09-20 13:01:03,098 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:03,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:03,104 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:03,104 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-09-20 13:01:03,109 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-09-20 13:01:03,109 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:03,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:03,111 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:03,111 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2019-09-20 13:01:03,174 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:03,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:03,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 28 [2019-09-20 13:01:03,182 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-09-20 13:01:03,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-09-20 13:01:03,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2019-09-20 13:01:03,183 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 28 states. [2019-09-20 13:01:04,437 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 62 [2019-09-20 13:01:20,684 WARN L191 SmtUtils]: Spent 16.12 s on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-09-20 13:01:21,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:21,163 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-09-20 13:01:21,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-20 13:01:21,163 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2019-09-20 13:01:21,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:21,164 INFO L225 Difference]: With dead ends: 119 [2019-09-20 13:01:21,164 INFO L226 Difference]: Without dead ends: 105 [2019-09-20 13:01:21,165 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=184, Invalid=1456, Unknown=0, NotChecked=0, Total=1640 [2019-09-20 13:01:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-09-20 13:01:21,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2019-09-20 13:01:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-09-20 13:01:21,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-09-20 13:01:21,175 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 39 [2019-09-20 13:01:21,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:21,177 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-09-20 13:01:21,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-09-20 13:01:21,178 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-09-20 13:01:21,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:01:21,181 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:21,181 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:21,181 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:21,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:21,182 INFO L82 PathProgramCache]: Analyzing trace with hash -731659325, now seen corresponding path program 1 times [2019-09-20 13:01:21,182 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:21,182 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:21,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:01:21,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:21,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:21,712 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:01:21,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:21,712 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:21,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:21,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:21,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 74 conjunts are in the unsatisfiable core [2019-09-20 13:01:21,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:21,890 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-09-20 13:01:21,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:21,897 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:21,897 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:21,897 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:01:21,971 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:21,972 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-09-20 13:01:21,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,004 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-09-20 13:01:22,005 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-09-20 13:01:22,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-09-20 13:01:22,052 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,068 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,072 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-09-20 13:01:22,073 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,090 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,090 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-09-20 13:01:22,129 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_30|]} [2019-09-20 13:01:22,133 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-09-20 13:01:22,133 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,172 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:22,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2019-09-20 13:01:22,174 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,197 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,201 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:22,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-09-20 13:01:22,203 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,222 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:58 [2019-09-20 13:01:22,281 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-09-20 13:01:22,282 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-09-20 13:01:22,371 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:22,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 132 [2019-09-20 13:01:22,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,385 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,453 INFO L567 ElimStorePlain]: treesize reduction 30, result has 84.8 percent of original size [2019-09-20 13:01:22,458 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:22,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2019-09-20 13:01:22,460 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,513 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 116 [2019-09-20 13:01:22,514 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,553 INFO L567 ElimStorePlain]: treesize reduction 42, result has 65.3 percent of original size [2019-09-20 13:01:22,553 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,553 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:188, output treesize:73 [2019-09-20 13:01:22,604 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_37|]} [2019-09-20 13:01:22,609 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2019-09-20 13:01:22,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,639 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2019-09-20 13:01:22,650 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,670 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:22,721 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,721 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 126 [2019-09-20 13:01:22,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:22,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:22,724 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:22,728 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:01:22,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,737 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-09-20 13:01:22,818 INFO L567 ElimStorePlain]: treesize reduction 781, result has 9.1 percent of original size [2019-09-20 13:01:22,819 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-09-20 13:01:22,820 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:181, output treesize:77 [2019-09-20 13:01:22,928 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-09-20 13:01:22,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:22,933 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-09-20 13:01:22,933 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:22,949 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:22,953 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:01:22,977 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-09-20 13:01:22,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 40 [2019-09-20 13:01:22,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:01:22,980 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:23,011 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-09-20 13:01:23,011 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:01:23,012 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:33 [2019-09-20 13:01:23,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:23,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:23,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:23,081 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-09-20 13:01:23,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:25 [2019-09-20 13:01:23,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:01:23,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-09-20 13:01:23,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:23,177 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:23,178 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-09-20 13:01:23,178 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-09-20 13:01:23,307 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-09-20 13:01:23,307 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:23,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:23,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:23,312 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-09-20 13:01:23,323 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:01:23,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:23,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-09-20 13:01:23,328 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-20 13:01:23,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-20 13:01:23,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=944, Unknown=0, NotChecked=0, Total=1056 [2019-09-20 13:01:23,329 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 33 states. [2019-09-20 13:01:24,265 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 62 [2019-09-20 13:01:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:01:25,134 INFO L93 Difference]: Finished difference Result 118 states and 132 transitions. [2019-09-20 13:01:25,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-20 13:01:25,135 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 40 [2019-09-20 13:01:25,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:01:25,136 INFO L225 Difference]: With dead ends: 118 [2019-09-20 13:01:25,136 INFO L226 Difference]: Without dead ends: 116 [2019-09-20 13:01:25,137 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 562 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=264, Invalid=1992, Unknown=0, NotChecked=0, Total=2256 [2019-09-20 13:01:25,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-09-20 13:01:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 101. [2019-09-20 13:01:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-09-20 13:01:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2019-09-20 13:01:25,146 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 40 [2019-09-20 13:01:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:01:25,147 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2019-09-20 13:01:25,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-20 13:01:25,147 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2019-09-20 13:01:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-09-20 13:01:25,147 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:01:25,148 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:01:25,148 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:01:25,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:01:25,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1250078526, now seen corresponding path program 1 times [2019-09-20 13:01:25,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:01:25,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:01:25,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:25,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:25,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:01:25,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:25,555 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:01:25,556 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:01:25,556 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:01:25,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:01:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:01:25,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 19 conjunts are in the unsatisfiable core [2019-09-20 13:01:25,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:01:25,720 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-09-20 13:01:25,720 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:25,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:25,729 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-09-20 13:01:25,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:25,735 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:25,736 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:25,736 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-09-20 13:01:25,775 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-20 13:01:25,776 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:25,782 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:25,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-09-20 13:01:25,784 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:01:25,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:01:25,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:01:25,791 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:37, output treesize:7 [2019-09-20 13:01:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:01:25,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:01:25,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 6] total 20 [2019-09-20 13:01:25,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-20 13:01:25,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-20 13:01:25,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-09-20 13:01:25,804 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand 20 states.