java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/running_example.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 18:09:01,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 18:09:01,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 18:09:01,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 18:09:01,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 18:09:01,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 18:09:01,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 18:09:01,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 18:09:01,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 18:09:01,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 18:09:01,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 18:09:01,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 18:09:01,314 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 18:09:01,315 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 18:09:01,320 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 18:09:01,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 18:09:01,323 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 18:09:01,326 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 18:09:01,327 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 18:09:01,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 18:09:01,336 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 18:09:01,337 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 18:09:01,338 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 18:09:01,340 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 18:09:01,344 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 18:09:01,345 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 18:09:01,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 18:09:01,347 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 18:09:01,348 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 18:09:01,350 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 18:09:01,350 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 18:09:01,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 18:09:01,353 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 18:09:01,353 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 18:09:01,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 18:09:01,355 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 18:09:01,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 18:09:01,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 18:09:01,356 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 18:09:01,358 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 18:09:01,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 18:09:01,362 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 18:09:01,380 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 18:09:01,380 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 18:09:01,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 18:09:01,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 18:09:01,383 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 18:09:01,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 18:09:01,384 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 18:09:01,384 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 18:09:01,384 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 18:09:01,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 18:09:01,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 18:09:01,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 18:09:01,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 18:09:01,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 18:09:01,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 18:09:01,387 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 18:09:01,387 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 18:09:01,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 18:09:01,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 18:09:01,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 18:09:01,388 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 18:09:01,388 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:09:01,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 18:09:01,389 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 18:09:01,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 18:09:01,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 18:09:01,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 18:09:01,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 18:09:01,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 18:09:01,660 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 18:09:01,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 18:09:01,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 18:09:01,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 18:09:01,681 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 18:09:01,681 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/running_example.i [2019-10-13 18:09:01,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bf22080/eea9836950074a5d822f67285b8f4588/FLAG8718f7e63 [2019-10-13 18:09:02,393 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 18:09:02,394 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/running_example.i [2019-10-13 18:09:02,412 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bf22080/eea9836950074a5d822f67285b8f4588/FLAG8718f7e63 [2019-10-13 18:09:02,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79bf22080/eea9836950074a5d822f67285b8f4588 [2019-10-13 18:09:02,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 18:09:02,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 18:09:02,698 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 18:09:02,699 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 18:09:02,702 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 18:09:02,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:09:02" (1/1) ... [2019-10-13 18:09:02,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e8d564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:02, skipping insertion in model container [2019-10-13 18:09:02,707 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:09:02" (1/1) ... [2019-10-13 18:09:02,715 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 18:09:02,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 18:09:03,220 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:09:03,242 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 18:09:03,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 18:09:03,344 INFO L192 MainTranslator]: Completed translation [2019-10-13 18:09:03,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03 WrapperNode [2019-10-13 18:09:03,345 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 18:09:03,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 18:09:03,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 18:09:03,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 18:09:03,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... [2019-10-13 18:09:03,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... [2019-10-13 18:09:03,382 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... [2019-10-13 18:09:03,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... [2019-10-13 18:09:03,396 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... [2019-10-13 18:09:03,401 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... [2019-10-13 18:09:03,404 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... [2019-10-13 18:09:03,410 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 18:09:03,411 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 18:09:03,411 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 18:09:03,411 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 18:09:03,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 18:09:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 18:09:03,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 18:09:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 18:09:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 18:09:03,462 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 18:09:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 18:09:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 18:09:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 18:09:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 18:09:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 18:09:03,463 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 18:09:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 18:09:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 18:09:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 18:09:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 18:09:03,464 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 18:09:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 18:09:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 18:09:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 18:09:03,465 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 18:09:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 18:09:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 18:09:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 18:09:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 18:09:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 18:09:03,466 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 18:09:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 18:09:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 18:09:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 18:09:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 18:09:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 18:09:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 18:09:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 18:09:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 18:09:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 18:09:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 18:09:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 18:09:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 18:09:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 18:09:03,468 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 18:09:03,469 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 18:09:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 18:09:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 18:09:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 18:09:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 18:09:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 18:09:03,470 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 18:09:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 18:09:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 18:09:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 18:09:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 18:09:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 18:09:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 18:09:03,471 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 18:09:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 18:09:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 18:09:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 18:09:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 18:09:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 18:09:03,472 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 18:09:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 18:09:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 18:09:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 18:09:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 18:09:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 18:09:03,473 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 18:09:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 18:09:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 18:09:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 18:09:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 18:09:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 18:09:03,474 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 18:09:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 18:09:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 18:09:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 18:09:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 18:09:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 18:09:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 18:09:03,475 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 18:09:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 18:09:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 18:09:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 18:09:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 18:09:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 18:09:03,476 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 18:09:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 18:09:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 18:09:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 18:09:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 18:09:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 18:09:03,477 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 18:09:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 18:09:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 18:09:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 18:09:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 18:09:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 18:09:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 18:09:03,478 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 18:09:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 18:09:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 18:09:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 18:09:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 18:09:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 18:09:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 18:09:03,479 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 18:09:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 18:09:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 18:09:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 18:09:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 18:09:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 18:09:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 18:09:03,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 18:09:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 18:09:03,481 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 18:09:04,028 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 18:09:04,028 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-13 18:09:04,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:09:04 BoogieIcfgContainer [2019-10-13 18:09:04,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 18:09:04,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 18:09:04,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 18:09:04,035 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 18:09:04,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:09:02" (1/3) ... [2019-10-13 18:09:04,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ab61f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:09:04, skipping insertion in model container [2019-10-13 18:09:04,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:09:03" (2/3) ... [2019-10-13 18:09:04,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ab61f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:09:04, skipping insertion in model container [2019-10-13 18:09:04,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:09:04" (3/3) ... [2019-10-13 18:09:04,038 INFO L109 eAbstractionObserver]: Analyzing ICFG running_example.i [2019-10-13 18:09:04,049 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 18:09:04,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 18:09:04,069 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 18:09:04,094 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 18:09:04,094 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 18:09:04,094 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 18:09:04,095 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 18:09:04,097 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 18:09:04,098 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 18:09:04,098 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 18:09:04,105 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 18:09:04,128 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-13 18:09:04,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 18:09:04,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:04,137 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:04,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1790475303, now seen corresponding path program 1 times [2019-10-13 18:09:04,152 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:04,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100266858] [2019-10-13 18:09:04,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:04,153 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:04,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:04,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100266858] [2019-10-13 18:09:04,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:04,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 18:09:04,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572136405] [2019-10-13 18:09:04,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 18:09:04,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:04,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 18:09:04,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:09:04,368 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2019-10-13 18:09:04,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:04,472 INFO L93 Difference]: Finished difference Result 32 states and 48 transitions. [2019-10-13 18:09:04,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 18:09:04,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-13 18:09:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:04,485 INFO L225 Difference]: With dead ends: 32 [2019-10-13 18:09:04,485 INFO L226 Difference]: Without dead ends: 19 [2019-10-13 18:09:04,489 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 18:09:04,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-13 18:09:04,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-13 18:09:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 18:09:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2019-10-13 18:09:04,527 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 12 [2019-10-13 18:09:04,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:04,527 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2019-10-13 18:09:04,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 18:09:04,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2019-10-13 18:09:04,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 18:09:04,528 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:04,528 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:04,529 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:04,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:04,529 INFO L82 PathProgramCache]: Analyzing trace with hash -734348207, now seen corresponding path program 1 times [2019-10-13 18:09:04,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:04,530 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025928117] [2019-10-13 18:09:04,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:04,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:04,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:04,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:04,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025928117] [2019-10-13 18:09:04,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:04,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 18:09:04,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114819434] [2019-10-13 18:09:04,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:09:04,727 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:04,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:09:04,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:09:04,728 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand 7 states. [2019-10-13 18:09:04,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:04,931 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2019-10-13 18:09:04,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 18:09:04,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-10-13 18:09:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:04,935 INFO L225 Difference]: With dead ends: 41 [2019-10-13 18:09:04,935 INFO L226 Difference]: Without dead ends: 32 [2019-10-13 18:09:04,937 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:04,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-13 18:09:04,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-10-13 18:09:04,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-13 18:09:04,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2019-10-13 18:09:04,945 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2019-10-13 18:09:04,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:04,945 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2019-10-13 18:09:04,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:09:04,945 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2019-10-13 18:09:04,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 18:09:04,946 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:04,947 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:04,947 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:04,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:04,947 INFO L82 PathProgramCache]: Analyzing trace with hash 147079127, now seen corresponding path program 1 times [2019-10-13 18:09:04,947 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:04,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002144948] [2019-10-13 18:09:04,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:04,948 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:04,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:05,137 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002144948] [2019-10-13 18:09:05,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [425383084] [2019-10-13 18:09:05,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:05,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-13 18:09:05,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:05,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:05,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,350 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 18:09:05,356 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,367 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,367 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-10-13 18:09:05,416 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,416 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:09:05,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,443 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,451 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:05,474 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:05,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-13 18:09:05,487 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,538 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-13 18:09:05,539 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2019-10-13 18:09:05,543 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,564 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:05,566 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:05,566 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:73, output treesize:11 [2019-10-13 18:09:05,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:05,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:05,616 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:05,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2019-10-13 18:09:05,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599916438] [2019-10-13 18:09:05,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 18:09:05,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:05,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 18:09:05,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-10-13 18:09:05,618 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 11 states. [2019-10-13 18:09:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:06,125 INFO L93 Difference]: Finished difference Result 52 states and 70 transitions. [2019-10-13 18:09:06,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:09:06,127 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 18 [2019-10-13 18:09:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:06,128 INFO L225 Difference]: With dead ends: 52 [2019-10-13 18:09:06,128 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 18:09:06,129 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2019-10-13 18:09:06,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 18:09:06,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-10-13 18:09:06,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-13 18:09:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2019-10-13 18:09:06,145 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 18 [2019-10-13 18:09:06,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:06,145 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2019-10-13 18:09:06,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 18:09:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2019-10-13 18:09:06,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 18:09:06,146 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:06,146 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:06,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:06,348 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:06,349 INFO L82 PathProgramCache]: Analyzing trace with hash 470360634, now seen corresponding path program 1 times [2019-10-13 18:09:06,349 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:06,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629749675] [2019-10-13 18:09:06,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:06,350 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:06,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:06,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:06,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629749675] [2019-10-13 18:09:06,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [933510911] [2019-10-13 18:09:06,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:06,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2019-10-13 18:09:06,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:06,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:06,662 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-10-13 18:09:06,662 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:06,680 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 20 treesize of output 9 [2019-10-13 18:09:06,680 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,690 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:44, output treesize:22 [2019-10-13 18:09:06,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-13 18:09:06,732 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,746 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-13 18:09:06,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,753 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:18 [2019-10-13 18:09:06,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-13 18:09:06,760 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,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 15 treesize of output 7 [2019-10-13 18:09:06,770 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,773 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:06,774 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:06,774 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-13 18:09:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:06,777 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:06,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-10-13 18:09:06,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901721224] [2019-10-13 18:09:06,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:09:06,778 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:06,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:09:06,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:09:06,779 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand 7 states. [2019-10-13 18:09:06,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:06,978 INFO L93 Difference]: Finished difference Result 58 states and 76 transitions. [2019-10-13 18:09:06,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 18:09:06,979 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-13 18:09:06,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:06,980 INFO L225 Difference]: With dead ends: 58 [2019-10-13 18:09:06,980 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 18:09:06,981 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-13 18:09:06,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 18:09:06,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2019-10-13 18:09:06,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-13 18:09:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-10-13 18:09:06,990 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 20 [2019-10-13 18:09:06,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:06,990 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-10-13 18:09:06,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:09:06,990 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-10-13 18:09:06,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 18:09:06,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:06,991 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:07,195 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:07,201 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash 977312820, now seen corresponding path program 1 times [2019-10-13 18:09:07,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:07,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758439554] [2019-10-13 18:09:07,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:07,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:07,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:07,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:07,325 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:07,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758439554] [2019-10-13 18:09:07,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918354450] [2019-10-13 18:09:07,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:07,420 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-13 18:09:07,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:07,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:07,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 18:09:07,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:07,491 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:07,491 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:07,491 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-13 18:09:07,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:07,499 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:07,500 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:07,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-10-13 18:09:07,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052668163] [2019-10-13 18:09:07,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 18:09:07,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:07,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 18:09:07,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-10-13 18:09:07,502 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 11 states. [2019-10-13 18:09:07,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:07,722 INFO L93 Difference]: Finished difference Result 88 states and 119 transitions. [2019-10-13 18:09:07,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 18:09:07,722 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 22 [2019-10-13 18:09:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:07,723 INFO L225 Difference]: With dead ends: 88 [2019-10-13 18:09:07,724 INFO L226 Difference]: Without dead ends: 86 [2019-10-13 18:09:07,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-10-13 18:09:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2019-10-13 18:09:07,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 58. [2019-10-13 18:09:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-13 18:09:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 82 transitions. [2019-10-13 18:09:07,736 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 82 transitions. Word has length 22 [2019-10-13 18:09:07,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:07,736 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 82 transitions. [2019-10-13 18:09:07,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 18:09:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 82 transitions. [2019-10-13 18:09:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 18:09:07,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:07,738 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:07,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:07,942 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:07,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:07,942 INFO L82 PathProgramCache]: Analyzing trace with hash 977314742, now seen corresponding path program 1 times [2019-10-13 18:09:07,943 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:07,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133554317] [2019-10-13 18:09:07,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:07,943 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:07,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:07,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:08,075 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:08,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133554317] [2019-10-13 18:09:08,076 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845138919] [2019-10-13 18:09:08,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:08,160 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 18:09:08,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:08,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 18:09:08,170 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,174 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,175 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2019-10-13 18:09:08,198 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 18:09:08,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:08,201 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:08,201 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-13 18:09:08,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:08,236 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:08,236 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-10-13 18:09:08,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764768193] [2019-10-13 18:09:08,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:09:08,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:08,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:09:08,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:08,238 INFO L87 Difference]: Start difference. First operand 58 states and 82 transitions. Second operand 12 states. [2019-10-13 18:09:08,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:08,525 INFO L93 Difference]: Finished difference Result 98 states and 134 transitions. [2019-10-13 18:09:08,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 18:09:08,526 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-10-13 18:09:08,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:08,527 INFO L225 Difference]: With dead ends: 98 [2019-10-13 18:09:08,527 INFO L226 Difference]: Without dead ends: 82 [2019-10-13 18:09:08,528 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-13 18:09:08,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-10-13 18:09:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 75. [2019-10-13 18:09:08,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 18:09:08,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 104 transitions. [2019-10-13 18:09:08,544 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 104 transitions. Word has length 22 [2019-10-13 18:09:08,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:08,544 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 104 transitions. [2019-10-13 18:09:08,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:09:08,545 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 104 transitions. [2019-10-13 18:09:08,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 18:09:08,546 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:08,546 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:08,757 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:08,758 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:08,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:08,758 INFO L82 PathProgramCache]: Analyzing trace with hash 167966194, now seen corresponding path program 1 times [2019-10-13 18:09:08,758 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:08,758 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832270549] [2019-10-13 18:09:08,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:08,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:08,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:08,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:08,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:08,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 18:09:08,836 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832270549] [2019-10-13 18:09:08,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 18:09:08,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 18:09:08,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216308535] [2019-10-13 18:09:08,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 18:09:08,837 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:08,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 18:09:08,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 18:09:08,838 INFO L87 Difference]: Start difference. First operand 75 states and 104 transitions. Second operand 7 states. [2019-10-13 18:09:08,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:08,961 INFO L93 Difference]: Finished difference Result 100 states and 137 transitions. [2019-10-13 18:09:08,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 18:09:08,964 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-10-13 18:09:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:08,965 INFO L225 Difference]: With dead ends: 100 [2019-10-13 18:09:08,965 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 18:09:08,965 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:08,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 18:09:08,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-10-13 18:09:08,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 18:09:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 103 transitions. [2019-10-13 18:09:08,975 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 103 transitions. Word has length 22 [2019-10-13 18:09:08,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:08,975 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 103 transitions. [2019-10-13 18:09:08,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 18:09:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 103 transitions. [2019-10-13 18:09:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 18:09:08,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:08,977 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:08,979 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:08,980 INFO L82 PathProgramCache]: Analyzing trace with hash 238325853, now seen corresponding path program 2 times [2019-10-13 18:09:08,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:08,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439004086] [2019-10-13 18:09:08,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:08,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:08,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:09,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439004086] [2019-10-13 18:09:09,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180591260] [2019-10-13 18:09:09,157 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:09,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 18:09:09,266 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 18:09:09,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-13 18:09:09,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:09,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:09,281 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,302 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,307 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 18:09:09,307 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,316 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,317 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:22 [2019-10-13 18:09:09,363 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,364 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-13 18:09:09,365 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,427 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.6 percent of original size [2019-10-13 18:09:09,432 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:09,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,466 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:09,488 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:09,500 INFO L341 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2019-10-13 18:09:09,500 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2019-10-13 18:09:09,501 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,519 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:79, output treesize:25 [2019-10-13 18:09:09,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,569 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-13 18:09:09,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,615 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-13 18:09:09,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-13 18:09:09,640 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,651 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,657 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-13 18:09:09,658 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:09,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:09,670 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:79, output treesize:11 [2019-10-13 18:09:09,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:09,715 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:09,716 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:09,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 12 [2019-10-13 18:09:09,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572136717] [2019-10-13 18:09:09,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:09:09,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:09,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:09:09,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:09,717 INFO L87 Difference]: Start difference. First operand 75 states and 103 transitions. Second operand 12 states. [2019-10-13 18:09:10,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:10,128 INFO L93 Difference]: Finished difference Result 137 states and 190 transitions. [2019-10-13 18:09:10,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 18:09:10,129 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-10-13 18:09:10,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:10,131 INFO L225 Difference]: With dead ends: 137 [2019-10-13 18:09:10,131 INFO L226 Difference]: Without dead ends: 117 [2019-10-13 18:09:10,132 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2019-10-13 18:09:10,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-10-13 18:09:10,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 71. [2019-10-13 18:09:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-13 18:09:10,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 97 transitions. [2019-10-13 18:09:10,141 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 97 transitions. Word has length 22 [2019-10-13 18:09:10,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:10,142 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 97 transitions. [2019-10-13 18:09:10,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:09:10,142 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 97 transitions. [2019-10-13 18:09:10,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 18:09:10,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:10,143 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:10,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:10,347 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:10,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:10,347 INFO L82 PathProgramCache]: Analyzing trace with hash -2035848896, now seen corresponding path program 1 times [2019-10-13 18:09:10,347 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:10,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593215094] [2019-10-13 18:09:10,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:10,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:10,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:10,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:10,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:10,647 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:10,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593215094] [2019-10-13 18:09:10,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722059266] [2019-10-13 18:09:10,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:10,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:10,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 18:09:10,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:10,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:10,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,769 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:09:10,806 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:09:10,807 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,854 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:10,859 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 36 treesize of output 17 [2019-10-13 18:09:10,860 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,896 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:10,910 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 36 treesize of output 17 [2019-10-13 18:09:10,911 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,931 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 18:09:10,932 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:10,948 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:10,948 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:101, output treesize:61 [2019-10-13 18:09:11,049 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2019-10-13 18:09:11,050 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,111 INFO L341 Elim1Store]: treesize reduction 32, result has 59.0 percent of original size [2019-10-13 18:09:11,111 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 87 [2019-10-13 18:09:11,113 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,155 INFO L567 ElimStorePlain]: treesize reduction 44, result has 63.9 percent of original size [2019-10-13 18:09:11,162 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 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-13 18:09:11,163 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,182 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,183 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,183 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2019-10-13 18:09:11,197 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2019-10-13 18:09:11,198 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,215 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.7 percent of original size [2019-10-13 18:09:11,218 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-10-13 18:09:11,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:11,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:11,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-13 18:09:11,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:11,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:11,234 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:11,234 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-10-13 18:09:11,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077399631] [2019-10-13 18:09:11,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:09:11,235 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:11,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:09:11,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:11,236 INFO L87 Difference]: Start difference. First operand 71 states and 97 transitions. Second operand 12 states. [2019-10-13 18:09:12,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:12,734 INFO L93 Difference]: Finished difference Result 166 states and 224 transitions. [2019-10-13 18:09:12,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-13 18:09:12,734 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-13 18:09:12,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:12,736 INFO L225 Difference]: With dead ends: 166 [2019-10-13 18:09:12,736 INFO L226 Difference]: Without dead ends: 164 [2019-10-13 18:09:12,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-10-13 18:09:12,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-10-13 18:09:12,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 115. [2019-10-13 18:09:12,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-10-13 18:09:12,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2019-10-13 18:09:12,750 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 24 [2019-10-13 18:09:12,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:12,751 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2019-10-13 18:09:12,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:09:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2019-10-13 18:09:12,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-13 18:09:12,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:12,752 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:12,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:12,957 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:12,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:12,958 INFO L82 PathProgramCache]: Analyzing trace with hash -2035846974, now seen corresponding path program 1 times [2019-10-13 18:09:12,958 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:12,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291627732] [2019-10-13 18:09:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:12,958 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:12,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:13,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:13,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:13,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291627732] [2019-10-13 18:09:13,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2064115223] [2019-10-13 18:09:13,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:13,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:13,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-13 18:09:13,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:13,386 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 18:09:13,386 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,398 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,398 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-10-13 18:09:13,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 18:09:13,419 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,459 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:13,463 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 40 treesize of output 19 [2019-10-13 18:09:13,464 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 18:09:13,498 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 40 treesize of output 19 [2019-10-13 18:09:13,498 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 18:09:13,521 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,541 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:109, output treesize:75 [2019-10-13 18:09:13,609 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 0 case distinctions, treesize of input 33 treesize of output 28 [2019-10-13 18:09:13,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,628 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,670 INFO L341 Elim1Store]: treesize reduction 32, result has 59.0 percent of original size [2019-10-13 18:09:13,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 73 treesize of output 87 [2019-10-13 18:09:13,672 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,713 INFO L567 ElimStorePlain]: treesize reduction 44, result has 63.3 percent of original size [2019-10-13 18:09:13,717 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 51 [2019-10-13 18:09:13,718 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,730 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,731 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,731 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:108, output treesize:61 [2019-10-13 18:09:13,748 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,748 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 56 [2019-10-13 18:09:13,750 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,769 INFO L567 ElimStorePlain]: treesize reduction 18, result has 66.7 percent of original size [2019-10-13 18:09:13,773 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2019-10-13 18:09:13,774 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:13,779 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:13,779 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:72, output treesize:7 [2019-10-13 18:09:13,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:13,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 18:09:13,801 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:13,801 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 12 [2019-10-13 18:09:13,801 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098093953] [2019-10-13 18:09:13,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 18:09:13,802 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:13,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 18:09:13,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-13 18:09:13,803 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand 12 states. [2019-10-13 18:09:15,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:15,420 INFO L93 Difference]: Finished difference Result 265 states and 379 transitions. [2019-10-13 18:09:15,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-13 18:09:15,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 24 [2019-10-13 18:09:15,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:15,422 INFO L225 Difference]: With dead ends: 265 [2019-10-13 18:09:15,422 INFO L226 Difference]: Without dead ends: 208 [2019-10-13 18:09:15,423 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-13 18:09:15,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-13 18:09:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 168. [2019-10-13 18:09:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-13 18:09:15,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 240 transitions. [2019-10-13 18:09:15,456 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 240 transitions. Word has length 24 [2019-10-13 18:09:15,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:15,457 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 240 transitions. [2019-10-13 18:09:15,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 18:09:15,457 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 240 transitions. [2019-10-13 18:09:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 18:09:15,464 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:15,464 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:15,676 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:15,676 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:15,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1986609468, now seen corresponding path program 1 times [2019-10-13 18:09:15,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:15,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745534753] [2019-10-13 18:09:15,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:15,678 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:15,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:15,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:15,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 18:09:15,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745534753] [2019-10-13 18:09:15,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672055148] [2019-10-13 18:09:15,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:15,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 18:09:15,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:15,883 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-13 18:09:15,883 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 18:09:15,885 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 18:09:15,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 18:09:15,885 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2019-10-13 18:09:15,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:15,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 18:09:15,893 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:15,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 9 [2019-10-13 18:09:15,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453749718] [2019-10-13 18:09:15,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 18:09:15,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:15,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 18:09:15,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 18:09:15,895 INFO L87 Difference]: Start difference. First operand 168 states and 240 transitions. Second operand 9 states. [2019-10-13 18:09:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 18:09:16,094 INFO L93 Difference]: Finished difference Result 308 states and 441 transitions. [2019-10-13 18:09:16,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 18:09:16,096 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2019-10-13 18:09:16,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 18:09:16,097 INFO L225 Difference]: With dead ends: 308 [2019-10-13 18:09:16,098 INFO L226 Difference]: Without dead ends: 237 [2019-10-13 18:09:16,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-13 18:09:16,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2019-10-13 18:09:16,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 201. [2019-10-13 18:09:16,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-10-13 18:09:16,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2019-10-13 18:09:16,115 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 26 [2019-10-13 18:09:16,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 18:09:16,117 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2019-10-13 18:09:16,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 18:09:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2019-10-13 18:09:16,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-13 18:09:16,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 18:09:16,125 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 18:09:16,330 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:16,330 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 18:09:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 18:09:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1177260920, now seen corresponding path program 1 times [2019-10-13 18:09:16,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 18:09:16,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725998885] [2019-10-13 18:09:16,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:16,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 18:09:16,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 18:09:16,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:16,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 18:09:16,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725998885] [2019-10-13 18:09:16,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201372962] [2019-10-13 18:09:16,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 18:09:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 18:09:16,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 18:09:16,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 18:09:16,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:16,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:16,588 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2019-10-13 18:09:16,589 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:16,596 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2019-10-13 18:09:16,597 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:16,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2019-10-13 18:09:16,603 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 18:09:16,634 INFO L567 ElimStorePlain]: treesize reduction 28, result has 53.3 percent of original size [2019-10-13 18:09:16,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-13 18:09:16,635 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:112, output treesize:32 [2019-10-13 18:09:21,268 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 23 DAG size of output: 13 [2019-10-13 18:09:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 18:09:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 18:09:24,069 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 18:09:24,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 11 [2019-10-13 18:09:24,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226834027] [2019-10-13 18:09:24,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 18:09:24,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 18:09:24,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 18:09:24,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=81, Unknown=4, NotChecked=0, Total=110 [2019-10-13 18:09:24,070 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand 11 states.