/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:21:46,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:21:46,407 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:21:46,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:21:46,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:21:46,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:21:46,426 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:21:46,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:21:46,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:21:46,431 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:21:46,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:21:46,433 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:21:46,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:21:46,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:21:46,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:21:46,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:21:46,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:21:46,438 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:21:46,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:21:46,442 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:21:46,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:21:46,445 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:21:46,446 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:21:46,450 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:21:46,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:21:46,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:21:46,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:21:46,455 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:21:46,455 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:21:46,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:21:46,457 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:21:46,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:21:46,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:21:46,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:21:46,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:21:46,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:21:46,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:21:46,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:21:46,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:21:46,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:21:46,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:21:46,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 19:21:46,489 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:21:46,489 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:21:46,491 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:21:46,491 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:21:46,491 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:21:46,492 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:21:46,492 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:21:46,492 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:21:46,492 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:21:46,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:21:46,493 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:21:46,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:21:46,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:21:46,494 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:21:46,495 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:21:46,495 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:21:46,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:21:46,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:21:46,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:21:46,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:21:46,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:21:46,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:21:46,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:21:46,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:21:46,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:21:46,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:21:46,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:21:46,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:21:46,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:21:46,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:21:46,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:21:46,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:21:46,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:21:46,775 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:21:46,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-11-06 19:21:46,849 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701a92bd4/e6d1cc19e47742f4b2e2fc4908dd2feb/FLAG0a4498ffb [2019-11-06 19:21:47,361 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:21:47,362 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-01-2.i [2019-11-06 19:21:47,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701a92bd4/e6d1cc19e47742f4b2e2fc4908dd2feb/FLAG0a4498ffb [2019-11-06 19:21:47,657 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/701a92bd4/e6d1cc19e47742f4b2e2fc4908dd2feb [2019-11-06 19:21:47,666 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:21:47,667 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:21:47,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:21:47,669 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:21:47,672 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:21:47,673 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:21:47" (1/1) ... [2019-11-06 19:21:47,676 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32ed9561 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:47, skipping insertion in model container [2019-11-06 19:21:47,676 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:21:47" (1/1) ... [2019-11-06 19:21:47,684 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:21:47,737 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:21:48,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:21:48,148 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:21:48,216 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:21:48,272 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:21:48,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48 WrapperNode [2019-11-06 19:21:48,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:21:48,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:21:48,274 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:21:48,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:21:48,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... [2019-11-06 19:21:48,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... [2019-11-06 19:21:48,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... [2019-11-06 19:21:48,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... [2019-11-06 19:21:48,322 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... [2019-11-06 19:21:48,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... [2019-11-06 19:21:48,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... [2019-11-06 19:21:48,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:21:48,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:21:48,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:21:48,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:21:48,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:21:48,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:21:48,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:21:48,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:21:48,409 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:21:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:21:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:21:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:21:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:21:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:21:48,410 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:21:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:21:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:21:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:21:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:21:48,411 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:21:48,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:21:48,412 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:21:48,412 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:21:48,412 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:21:48,412 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:21:48,412 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:21:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:21:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:21:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:21:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:21:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:21:48,413 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:21:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:21:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:21:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:21:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:21:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:21:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:21:48,414 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:21:48,415 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:21:48,415 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:21:48,415 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:21:48,415 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:21:48,415 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:21:48,415 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:21:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:21:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:21:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:21:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:21:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:21:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:21:48,416 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:21:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:21:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:21:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:21:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:21:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:21:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:21:48,417 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:21:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:21:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:21:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:21:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:21:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:21:48,418 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:21:48,419 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:21:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:21:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:21:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:21:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:21:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:21:48,420 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:21:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:21:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:21:48,421 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:21:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:21:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:21:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:21:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:21:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:21:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:21:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:21:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:21:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:21:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:21:48,425 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:21:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:21:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:21:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:21:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:21:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:21:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:21:48,426 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:21:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:21:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:21:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:21:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:21:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:21:48,427 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:21:48,428 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:21:49,138 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:21:49,138 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-06 19:21:49,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:21:49 BoogieIcfgContainer [2019-11-06 19:21:49,140 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:21:49,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:21:49,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:21:49,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:21:49,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:21:47" (1/3) ... [2019-11-06 19:21:49,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cf0de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:21:49, skipping insertion in model container [2019-11-06 19:21:49,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:21:48" (2/3) ... [2019-11-06 19:21:49,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66cf0de9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:21:49, skipping insertion in model container [2019-11-06 19:21:49,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:21:49" (3/3) ... [2019-11-06 19:21:49,147 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-01-2.i [2019-11-06 19:21:49,157 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:21:49,165 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2019-11-06 19:21:49,176 INFO L249 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2019-11-06 19:21:49,211 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:21:49,211 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:21:49,212 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:21:49,212 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:21:49,212 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:21:49,212 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:21:49,212 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:21:49,212 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:21:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states. [2019-11-06 19:21:49,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-06 19:21:49,241 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:49,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:49,244 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:49,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:49,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1861454184, now seen corresponding path program 1 times [2019-11-06 19:21:49,262 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:49,262 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028003138] [2019-11-06 19:21:49,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:49,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:49,478 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028003138] [2019-11-06 19:21:49,479 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:49,479 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:21:49,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28646856] [2019-11-06 19:21:49,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:21:49,487 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:49,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:21:49,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:49,508 INFO L87 Difference]: Start difference. First operand 88 states. Second operand 4 states. [2019-11-06 19:21:49,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:49,804 INFO L93 Difference]: Finished difference Result 186 states and 302 transitions. [2019-11-06 19:21:49,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:21:49,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-11-06 19:21:49,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:49,816 INFO L225 Difference]: With dead ends: 186 [2019-11-06 19:21:49,817 INFO L226 Difference]: Without dead ends: 99 [2019-11-06 19:21:49,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:49,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-11-06 19:21:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 81. [2019-11-06 19:21:49,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-06 19:21:49,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-11-06 19:21:49,867 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 8 [2019-11-06 19:21:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:49,867 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-11-06 19:21:49,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:21:49,868 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-11-06 19:21:49,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:21:49,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:49,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:49,869 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:49,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:49,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1461031906, now seen corresponding path program 1 times [2019-11-06 19:21:49,869 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:49,870 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335175106] [2019-11-06 19:21:49,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:49,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:49,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:49,946 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335175106] [2019-11-06 19:21:49,946 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:49,946 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:21:49,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770164949] [2019-11-06 19:21:49,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:21:49,948 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:49,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:21:49,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:49,949 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 4 states. [2019-11-06 19:21:50,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:50,142 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-11-06 19:21:50,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:21:50,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-06 19:21:50,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:50,144 INFO L225 Difference]: With dead ends: 84 [2019-11-06 19:21:50,144 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 19:21:50,145 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 19:21:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2019-11-06 19:21:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-06 19:21:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2019-11-06 19:21:50,156 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 14 [2019-11-06 19:21:50,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:50,156 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2019-11-06 19:21:50,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:21:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2019-11-06 19:21:50,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 19:21:50,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:50,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:50,161 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:50,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1461033828, now seen corresponding path program 1 times [2019-11-06 19:21:50,161 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:50,161 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842310472] [2019-11-06 19:21:50,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:50,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:50,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842310472] [2019-11-06 19:21:50,284 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:50,284 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:21:50,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523167385] [2019-11-06 19:21:50,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:21:50,289 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:50,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:21:50,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:21:50,290 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 5 states. [2019-11-06 19:21:50,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:50,482 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2019-11-06 19:21:50,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:21:50,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 19:21:50,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:50,484 INFO L225 Difference]: With dead ends: 84 [2019-11-06 19:21:50,484 INFO L226 Difference]: Without dead ends: 82 [2019-11-06 19:21:50,485 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:21:50,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-06 19:21:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2019-11-06 19:21:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-06 19:21:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-11-06 19:21:50,493 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 14 [2019-11-06 19:21:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:50,493 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-11-06 19:21:50,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:21:50,493 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-11-06 19:21:50,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 19:21:50,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:50,494 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:50,495 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash 177734485, now seen corresponding path program 1 times [2019-11-06 19:21:50,496 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:50,496 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714269315] [2019-11-06 19:21:50,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:50,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:50,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:50,575 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714269315] [2019-11-06 19:21:50,576 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:50,576 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:21:50,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935825943] [2019-11-06 19:21:50,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:21:50,577 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:50,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:21:50,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:21:50,577 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 5 states. [2019-11-06 19:21:50,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:50,862 INFO L93 Difference]: Finished difference Result 199 states and 221 transitions. [2019-11-06 19:21:50,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:21:50,863 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-06 19:21:50,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:50,864 INFO L225 Difference]: With dead ends: 199 [2019-11-06 19:21:50,864 INFO L226 Difference]: Without dead ends: 132 [2019-11-06 19:21:50,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:21:50,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-06 19:21:50,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 81. [2019-11-06 19:21:50,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-06 19:21:50,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2019-11-06 19:21:50,884 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 19 [2019-11-06 19:21:50,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:50,885 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2019-11-06 19:21:50,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:21:50,885 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2019-11-06 19:21:50,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-06 19:21:50,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:50,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:50,887 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:50,888 INFO L82 PathProgramCache]: Analyzing trace with hash -631612141, now seen corresponding path program 1 times [2019-11-06 19:21:50,889 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:50,889 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522520717] [2019-11-06 19:21:50,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:51,055 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522520717] [2019-11-06 19:21:51,055 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:51,055 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:21:51,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099070396] [2019-11-06 19:21:51,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:21:51,056 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:51,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:21:51,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:21:51,057 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 6 states. [2019-11-06 19:21:51,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:51,312 INFO L93 Difference]: Finished difference Result 126 states and 140 transitions. [2019-11-06 19:21:51,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:21:51,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-06 19:21:51,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:51,314 INFO L225 Difference]: With dead ends: 126 [2019-11-06 19:21:51,314 INFO L226 Difference]: Without dead ends: 122 [2019-11-06 19:21:51,316 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:21:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-11-06 19:21:51,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-11-06 19:21:51,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-06 19:21:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2019-11-06 19:21:51,333 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 19 [2019-11-06 19:21:51,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:51,335 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2019-11-06 19:21:51,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:21:51,335 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2019-11-06 19:21:51,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:21:51,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:51,336 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:51,341 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1894864309, now seen corresponding path program 1 times [2019-11-06 19:21:51,341 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:51,343 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133312799] [2019-11-06 19:21:51,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:51,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133312799] [2019-11-06 19:21:51,438 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:51,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:21:51,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955704699] [2019-11-06 19:21:51,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:21:51,440 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:51,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:21:51,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:21:51,441 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 6 states. [2019-11-06 19:21:51,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:51,630 INFO L93 Difference]: Finished difference Result 136 states and 150 transitions. [2019-11-06 19:21:51,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:21:51,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-06 19:21:51,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:51,631 INFO L225 Difference]: With dead ends: 136 [2019-11-06 19:21:51,632 INFO L226 Difference]: Without dead ends: 116 [2019-11-06 19:21:51,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:21:51,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-06 19:21:51,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 76. [2019-11-06 19:21:51,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-06 19:21:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2019-11-06 19:21:51,639 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 20 [2019-11-06 19:21:51,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:51,640 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2019-11-06 19:21:51,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:21:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2019-11-06 19:21:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 19:21:51,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:51,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:51,642 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:51,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:51,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1337316768, now seen corresponding path program 1 times [2019-11-06 19:21:51,642 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:51,642 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100550184] [2019-11-06 19:21:51,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:51,680 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100550184] [2019-11-06 19:21:51,681 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:51,681 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:21:51,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481339150] [2019-11-06 19:21:51,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:21:51,682 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:51,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:21:51,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:51,682 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 4 states. [2019-11-06 19:21:51,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:51,821 INFO L93 Difference]: Finished difference Result 141 states and 159 transitions. [2019-11-06 19:21:51,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:21:51,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-06 19:21:51,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:51,823 INFO L225 Difference]: With dead ends: 141 [2019-11-06 19:21:51,823 INFO L226 Difference]: Without dead ends: 100 [2019-11-06 19:21:51,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:51,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-06 19:21:51,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 79. [2019-11-06 19:21:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-11-06 19:21:51,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-11-06 19:21:51,839 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 24 [2019-11-06 19:21:51,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:51,840 INFO L462 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-11-06 19:21:51,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:21:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-11-06 19:21:51,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-06 19:21:51,841 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:51,841 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:51,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:51,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:51,842 INFO L82 PathProgramCache]: Analyzing trace with hash -1492857654, now seen corresponding path program 1 times [2019-11-06 19:21:51,842 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:51,842 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748937093] [2019-11-06 19:21:51,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:51,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:51,921 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748937093] [2019-11-06 19:21:51,921 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:51,921 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:21:51,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342468589] [2019-11-06 19:21:51,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:21:51,922 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:51,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:21:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:51,924 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 4 states. [2019-11-06 19:21:52,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:52,059 INFO L93 Difference]: Finished difference Result 79 states and 89 transitions. [2019-11-06 19:21:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:21:52,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-11-06 19:21:52,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:52,061 INFO L225 Difference]: With dead ends: 79 [2019-11-06 19:21:52,061 INFO L226 Difference]: Without dead ends: 77 [2019-11-06 19:21:52,061 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:52,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-06 19:21:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-06 19:21:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-06 19:21:52,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2019-11-06 19:21:52,066 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 25 [2019-11-06 19:21:52,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:52,066 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2019-11-06 19:21:52,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:21:52,066 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2019-11-06 19:21:52,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-06 19:21:52,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:52,068 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:52,068 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:52,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:52,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1632693981, now seen corresponding path program 1 times [2019-11-06 19:21:52,069 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:52,069 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982760697] [2019-11-06 19:21:52,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:52,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:52,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:52,119 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982760697] [2019-11-06 19:21:52,119 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:52,119 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:21:52,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556871567] [2019-11-06 19:21:52,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:21:52,120 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:52,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:21:52,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:21:52,121 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 5 states. [2019-11-06 19:21:52,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:52,252 INFO L93 Difference]: Finished difference Result 78 states and 88 transitions. [2019-11-06 19:21:52,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 19:21:52,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-11-06 19:21:52,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:52,253 INFO L225 Difference]: With dead ends: 78 [2019-11-06 19:21:52,254 INFO L226 Difference]: Without dead ends: 76 [2019-11-06 19:21:52,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:21:52,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-06 19:21:52,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2019-11-06 19:21:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 19:21:52,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2019-11-06 19:21:52,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 27 [2019-11-06 19:21:52,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:52,259 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2019-11-06 19:21:52,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:21:52,259 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2019-11-06 19:21:52,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 19:21:52,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:52,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:52,261 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:52,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:52,261 INFO L82 PathProgramCache]: Analyzing trace with hash 668074133, now seen corresponding path program 1 times [2019-11-06 19:21:52,262 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:52,262 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806167018] [2019-11-06 19:21:52,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:52,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:52,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:52,371 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806167018] [2019-11-06 19:21:52,371 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:52,371 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:21:52,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686278452] [2019-11-06 19:21:52,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:21:52,372 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:52,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:21:52,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:21:52,373 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand 7 states. [2019-11-06 19:21:52,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:52,731 INFO L93 Difference]: Finished difference Result 179 states and 203 transitions. [2019-11-06 19:21:52,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 19:21:52,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-11-06 19:21:52,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:52,733 INFO L225 Difference]: With dead ends: 179 [2019-11-06 19:21:52,733 INFO L226 Difference]: Without dead ends: 137 [2019-11-06 19:21:52,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:21:52,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-06 19:21:52,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 85. [2019-11-06 19:21:52,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-06 19:21:52,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 96 transitions. [2019-11-06 19:21:52,738 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 96 transitions. Word has length 28 [2019-11-06 19:21:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:52,739 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 96 transitions. [2019-11-06 19:21:52,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:21:52,739 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 96 transitions. [2019-11-06 19:21:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 19:21:52,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:52,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:52,741 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:52,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash 567478293, now seen corresponding path program 1 times [2019-11-06 19:21:52,741 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:52,742 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079698286] [2019-11-06 19:21:52,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:52,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:53,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:53,009 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079698286] [2019-11-06 19:21:53,009 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:53,009 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 19:21:53,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802127377] [2019-11-06 19:21:53,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 19:21:53,010 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:53,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 19:21:53,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:21:53,011 INFO L87 Difference]: Start difference. First operand 85 states and 96 transitions. Second operand 10 states. [2019-11-06 19:21:53,815 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-06 19:21:54,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:54,096 INFO L93 Difference]: Finished difference Result 175 states and 196 transitions. [2019-11-06 19:21:54,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 19:21:54,097 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-11-06 19:21:54,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:54,100 INFO L225 Difference]: With dead ends: 175 [2019-11-06 19:21:54,100 INFO L226 Difference]: Without dead ends: 173 [2019-11-06 19:21:54,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:21:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-06 19:21:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 104. [2019-11-06 19:21:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-06 19:21:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 120 transitions. [2019-11-06 19:21:54,109 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 120 transitions. Word has length 28 [2019-11-06 19:21:54,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:54,109 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 120 transitions. [2019-11-06 19:21:54,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 19:21:54,109 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 120 transitions. [2019-11-06 19:21:54,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 19:21:54,110 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:54,111 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:54,111 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:54,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1429819819, now seen corresponding path program 1 times [2019-11-06 19:21:54,112 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:54,112 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555339282] [2019-11-06 19:21:54,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:54,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:21:54,182 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555339282] [2019-11-06 19:21:54,182 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:54,182 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:21:54,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569046444] [2019-11-06 19:21:54,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:21:54,183 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:54,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:21:54,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:21:54,183 INFO L87 Difference]: Start difference. First operand 104 states and 120 transitions. Second operand 6 states. [2019-11-06 19:21:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:54,427 INFO L93 Difference]: Finished difference Result 151 states and 173 transitions. [2019-11-06 19:21:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:21:54,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-11-06 19:21:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:54,429 INFO L225 Difference]: With dead ends: 151 [2019-11-06 19:21:54,429 INFO L226 Difference]: Without dead ends: 133 [2019-11-06 19:21:54,430 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:21:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-06 19:21:54,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 124. [2019-11-06 19:21:54,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-06 19:21:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 147 transitions. [2019-11-06 19:21:54,438 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 147 transitions. Word has length 30 [2019-11-06 19:21:54,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:54,438 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 147 transitions. [2019-11-06 19:21:54,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:21:54,438 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 147 transitions. [2019-11-06 19:21:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-06 19:21:54,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:54,440 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:54,440 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:54,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:54,441 INFO L82 PathProgramCache]: Analyzing trace with hash -753501909, now seen corresponding path program 1 times [2019-11-06 19:21:54,441 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:54,441 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605036347] [2019-11-06 19:21:54,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:54,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:21:54,475 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605036347] [2019-11-06 19:21:54,475 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:54,475 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:21:54,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710773173] [2019-11-06 19:21:54,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:21:54,476 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:54,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:21:54,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:54,477 INFO L87 Difference]: Start difference. First operand 124 states and 147 transitions. Second operand 4 states. [2019-11-06 19:21:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:54,606 INFO L93 Difference]: Finished difference Result 125 states and 148 transitions. [2019-11-06 19:21:54,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:21:54,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-11-06 19:21:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:54,608 INFO L225 Difference]: With dead ends: 125 [2019-11-06 19:21:54,608 INFO L226 Difference]: Without dead ends: 123 [2019-11-06 19:21:54,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:54,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-11-06 19:21:54,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2019-11-06 19:21:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-11-06 19:21:54,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2019-11-06 19:21:54,615 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 30 [2019-11-06 19:21:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:54,616 INFO L462 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2019-11-06 19:21:54,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:21:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2019-11-06 19:21:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-06 19:21:54,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:54,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:54,617 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 758661948, now seen corresponding path program 1 times [2019-11-06 19:21:54,618 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:54,618 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021471999] [2019-11-06 19:21:54,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:54,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:54,844 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021471999] [2019-11-06 19:21:54,844 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:54,845 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 19:21:54,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621408564] [2019-11-06 19:21:54,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 19:21:54,845 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:54,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 19:21:54,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-11-06 19:21:54,846 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand 10 states. [2019-11-06 19:21:55,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:55,637 INFO L93 Difference]: Finished difference Result 201 states and 229 transitions. [2019-11-06 19:21:55,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 19:21:55,638 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2019-11-06 19:21:55,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:55,639 INFO L225 Difference]: With dead ends: 201 [2019-11-06 19:21:55,639 INFO L226 Difference]: Without dead ends: 199 [2019-11-06 19:21:55,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2019-11-06 19:21:55,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2019-11-06 19:21:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 129. [2019-11-06 19:21:55,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-06 19:21:55,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2019-11-06 19:21:55,650 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 31 [2019-11-06 19:21:55,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:55,650 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2019-11-06 19:21:55,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 19:21:55,651 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2019-11-06 19:21:55,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 19:21:55,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:55,652 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:55,652 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:55,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:55,652 INFO L82 PathProgramCache]: Analyzing trace with hash -999338862, now seen corresponding path program 1 times [2019-11-06 19:21:55,653 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:55,653 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004900867] [2019-11-06 19:21:55,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:55,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:55,725 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:55,726 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004900867] [2019-11-06 19:21:55,726 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684308189] [2019-11-06 19:21:55,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:21:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:55,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-06 19:21:55,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:21:55,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,901 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 16 treesize of output 17 [2019-11-06 19:21:55,901 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:55,910 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:55,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,918 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 16 treesize of output 17 [2019-11-06 19:21:55,919 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:55,933 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:55,934 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:55,934 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:36 [2019-11-06 19:21:55,963 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,965 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,966 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,968 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-06 19:21:55,969 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:55,984 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:55,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:55,993 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-11-06 19:21:55,994 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:56,007 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:56,008 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:56,008 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:62, output treesize:54 [2019-11-06 19:21:56,089 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2019-11-06 19:21:56,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:56,103 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:56,106 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:56,107 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 13 [2019-11-06 19:21:56,107 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:56,112 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:56,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:56,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:7 [2019-11-06 19:21:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:56,126 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:21:56,126 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-11-06 19:21:56,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904626013] [2019-11-06 19:21:56,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:21:56,127 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:56,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:21:56,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-06 19:21:56,128 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand 9 states. [2019-11-06 19:21:56,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:56,572 INFO L93 Difference]: Finished difference Result 220 states and 252 transitions. [2019-11-06 19:21:56,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 19:21:56,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-11-06 19:21:56,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:56,574 INFO L225 Difference]: With dead ends: 220 [2019-11-06 19:21:56,574 INFO L226 Difference]: Without dead ends: 160 [2019-11-06 19:21:56,575 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:21:56,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-06 19:21:56,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 120. [2019-11-06 19:21:56,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-11-06 19:21:56,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2019-11-06 19:21:56,586 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 33 [2019-11-06 19:21:56,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:56,586 INFO L462 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2019-11-06 19:21:56,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:21:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2019-11-06 19:21:56,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-06 19:21:56,587 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:56,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:56,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:21:56,793 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:56,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:56,794 INFO L82 PathProgramCache]: Analyzing trace with hash -2072098386, now seen corresponding path program 1 times [2019-11-06 19:21:56,794 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:56,794 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28034357] [2019-11-06 19:21:56,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:56,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:57,030 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28034357] [2019-11-06 19:21:57,031 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:57,031 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:21:57,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871449369] [2019-11-06 19:21:57,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:21:57,032 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:21:57,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:21:57,033 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand 7 states. [2019-11-06 19:21:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:57,366 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2019-11-06 19:21:57,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:21:57,367 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-11-06 19:21:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:57,368 INFO L225 Difference]: With dead ends: 161 [2019-11-06 19:21:57,368 INFO L226 Difference]: Without dead ends: 141 [2019-11-06 19:21:57,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-06 19:21:57,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-06 19:21:57,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 119. [2019-11-06 19:21:57,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-11-06 19:21:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2019-11-06 19:21:57,379 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 33 [2019-11-06 19:21:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:57,380 INFO L462 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2019-11-06 19:21:57,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:21:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2019-11-06 19:21:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-06 19:21:57,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:57,382 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:57,382 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:57,383 INFO L82 PathProgramCache]: Analyzing trace with hash -1941174974, now seen corresponding path program 1 times [2019-11-06 19:21:57,383 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:57,383 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898060394] [2019-11-06 19:21:57,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:57,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:57,431 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898060394] [2019-11-06 19:21:57,431 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:21:57,433 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 19:21:57,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [587163090] [2019-11-06 19:21:57,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 19:21:57,434 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:57,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 19:21:57,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:57,435 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand 4 states. [2019-11-06 19:21:57,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:57,592 INFO L93 Difference]: Finished difference Result 224 states and 258 transitions. [2019-11-06 19:21:57,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 19:21:57,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-06 19:21:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:57,594 INFO L225 Difference]: With dead ends: 224 [2019-11-06 19:21:57,594 INFO L226 Difference]: Without dead ends: 169 [2019-11-06 19:21:57,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 19:21:57,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-06 19:21:57,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 142. [2019-11-06 19:21:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-11-06 19:21:57,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 163 transitions. [2019-11-06 19:21:57,611 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 163 transitions. Word has length 35 [2019-11-06 19:21:57,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:57,611 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 163 transitions. [2019-11-06 19:21:57,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 19:21:57,611 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 163 transitions. [2019-11-06 19:21:57,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-06 19:21:57,612 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:57,612 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:57,613 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:57,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:57,614 INFO L82 PathProgramCache]: Analyzing trace with hash 930038423, now seen corresponding path program 1 times [2019-11-06 19:21:57,614 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:57,614 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37866802] [2019-11-06 19:21:57,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:57,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:57,741 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:57,741 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37866802] [2019-11-06 19:21:57,742 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872809743] [2019-11-06 19:21:57,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:21:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:57,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-06 19:21:57,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:21:57,863 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:21:57,864 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:57,874 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:57,878 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:21:57,878 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:57,883 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:57,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:57,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:19 [2019-11-06 19:21:57,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:57,982 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2019-11-06 19:21:57,982 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:57,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:57,997 INFO L341 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2019-11-06 19:21:57,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 10 [2019-11-06 19:21:57,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:58,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:58,002 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:58,002 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:47, output treesize:7 [2019-11-06 19:21:58,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:58,009 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:21:58,010 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-11-06 19:21:58,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079952803] [2019-11-06 19:21:58,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 19:21:58,011 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:21:58,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 19:21:58,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:21:58,011 INFO L87 Difference]: Start difference. First operand 142 states and 163 transitions. Second operand 11 states. [2019-11-06 19:21:58,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:21:58,538 INFO L93 Difference]: Finished difference Result 268 states and 303 transitions. [2019-11-06 19:21:58,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 19:21:58,539 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-06 19:21:58,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:21:58,540 INFO L225 Difference]: With dead ends: 268 [2019-11-06 19:21:58,540 INFO L226 Difference]: Without dead ends: 224 [2019-11-06 19:21:58,541 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:21:58,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2019-11-06 19:21:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 169. [2019-11-06 19:21:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2019-11-06 19:21:58,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 200 transitions. [2019-11-06 19:21:58,555 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 200 transitions. Word has length 36 [2019-11-06 19:21:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:21:58,556 INFO L462 AbstractCegarLoop]: Abstraction has 169 states and 200 transitions. [2019-11-06 19:21:58,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 19:21:58,556 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 200 transitions. [2019-11-06 19:21:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 19:21:58,557 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:21:58,557 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:21:58,761 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:21:58,762 INFO L410 AbstractCegarLoop]: === Iteration 19 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:21:58,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:21:58,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1341973316, now seen corresponding path program 1 times [2019-11-06 19:21:58,762 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:21:58,762 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319089735] [2019-11-06 19:21:58,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:21:58,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:59,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:59,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:21:59,047 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319089735] [2019-11-06 19:21:59,047 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1513642015] [2019-11-06 19:21:59,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:21:59,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:21:59,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 30 conjunts are in the unsatisfiable core [2019-11-06 19:21:59,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:21:59,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:21:59,169 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,173 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,173 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:21:59,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:21:59,183 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,193 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,196 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-06 19:21:59,197 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,204 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,204 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,205 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:27 [2019-11-06 19:21:59,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,251 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-06 19:21:59,252 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,303 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_41|], 16=[|v_#memory_$Pointer$.base_41|]} [2019-11-06 19:21:59,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:59,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:59,312 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:21:59,333 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,333 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 73 treesize of output 58 [2019-11-06 19:21:59,334 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,394 INFO L567 ElimStorePlain]: treesize reduction 22, result has 86.8 percent of original size [2019-11-06 19:21:59,409 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:59,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:59,477 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,478 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 3 case distinctions, treesize of input 76 treesize of output 123 [2019-11-06 19:21:59,479 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,550 INFO L567 ElimStorePlain]: treesize reduction 78, result has 50.9 percent of original size [2019-11-06 19:21:59,552 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,552 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:191, output treesize:95 [2019-11-06 19:21:59,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:59,633 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:59,734 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:21:59,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 131 treesize of output 227 [2019-11-06 19:21:59,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,740 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:21:59,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:21:59,910 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 58 [2019-11-06 19:21:59,911 INFO L341 Elim1Store]: treesize reduction 60, result has 74.5 percent of original size [2019-11-06 19:21:59,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 128 treesize of output 245 [2019-11-06 19:21:59,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:21:59,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:21:59,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:21:59,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:00,235 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-11-06 19:22:00,235 INFO L567 ElimStorePlain]: treesize reduction 1421, result has 15.2 percent of original size [2019-11-06 19:22:00,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:00,412 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 56 [2019-11-06 19:22:00,413 INFO L341 Elim1Store]: treesize reduction 66, result has 72.6 percent of original size [2019-11-06 19:22:00,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 133 treesize of output 267 [2019-11-06 19:22:00,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,437 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:00,454 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:00,519 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:00,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 225 [2019-11-06 19:22:00,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:00,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:00,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,542 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:00,778 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 55 [2019-11-06 19:22:00,779 INFO L567 ElimStorePlain]: treesize reduction 1107, result has 16.5 percent of original size [2019-11-06 19:22:00,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,782 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-06 19:22:00,782 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:260, output treesize:223 [2019-11-06 19:22:00,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,927 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:00,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,335 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2019-11-06 19:22:01,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 19:22:01,355 INFO L392 ElimStorePlain]: Different costs {10=[v_prenex_2, v_prenex_3, v_prenex_5, v_prenex_6], 18=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|]} [2019-11-06 19:22:01,384 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:01,418 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:01,419 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-11-06 19:22:01,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,425 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:01,556 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 88 [2019-11-06 19:22:01,556 INFO L567 ElimStorePlain]: treesize reduction 36, result has 88.3 percent of original size [2019-11-06 19:22:01,567 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:01,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-11-06 19:22:01,568 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:01,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:01,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:01,678 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:01,679 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 132 [2019-11-06 19:22:01,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,682 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:01,684 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:01,803 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 65 [2019-11-06 19:22:01,804 INFO L567 ElimStorePlain]: treesize reduction 36, result has 83.3 percent of original size [2019-11-06 19:22:01,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:01,812 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 38 [2019-11-06 19:22:01,813 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:01,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:02,012 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-06 19:22:02,013 INFO L341 Elim1Store]: treesize reduction 10, result has 92.2 percent of original size [2019-11-06 19:22:02,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 119 treesize of output 184 [2019-11-06 19:22:02,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,024 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,026 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,057 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:02,164 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-11-06 19:22:02,164 INFO L567 ElimStorePlain]: treesize reduction 88, result has 54.2 percent of original size [2019-11-06 19:22:02,187 INFO L341 Elim1Store]: treesize reduction 10, result has 65.5 percent of original size [2019-11-06 19:22:02,188 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 68 [2019-11-06 19:22:02,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:02,190 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:02,208 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:02,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:02,209 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:330, output treesize:7 [2019-11-06 19:22:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:02,224 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:02,224 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2019-11-06 19:22:02,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779384366] [2019-11-06 19:22:02,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 19:22:02,225 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:02,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 19:22:02,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=139, Unknown=1, NotChecked=0, Total=182 [2019-11-06 19:22:02,226 INFO L87 Difference]: Start difference. First operand 169 states and 200 transitions. Second operand 14 states. [2019-11-06 19:22:02,702 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-06 19:22:03,473 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 67 [2019-11-06 19:22:03,761 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 71 [2019-11-06 19:22:04,028 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-11-06 19:22:04,208 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-11-06 19:22:04,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:04,639 INFO L93 Difference]: Finished difference Result 449 states and 525 transitions. [2019-11-06 19:22:04,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-06 19:22:04,640 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2019-11-06 19:22:04,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:04,643 INFO L225 Difference]: With dead ends: 449 [2019-11-06 19:22:04,643 INFO L226 Difference]: Without dead ends: 361 [2019-11-06 19:22:04,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=195, Invalid=614, Unknown=3, NotChecked=0, Total=812 [2019-11-06 19:22:04,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2019-11-06 19:22:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 191. [2019-11-06 19:22:04,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-06 19:22:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 225 transitions. [2019-11-06 19:22:04,657 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 225 transitions. Word has length 40 [2019-11-06 19:22:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:04,657 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 225 transitions. [2019-11-06 19:22:04,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 19:22:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 225 transitions. [2019-11-06 19:22:04,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-06 19:22:04,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:04,658 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:04,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:04,862 INFO L410 AbstractCegarLoop]: === Iteration 20 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:04,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -2026576836, now seen corresponding path program 1 times [2019-11-06 19:22:04,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:04,863 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420753213] [2019-11-06 19:22:04,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:04,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:05,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:05,555 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:05,555 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420753213] [2019-11-06 19:22:05,556 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036029222] [2019-11-06 19:22:05,556 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-11-06 19:22:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:05,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-06 19:22:05,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:05,676 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:22:05,677 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:05,689 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:05,690 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:05,690 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:22:05,723 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:05,723 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:22:05,724 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:05,806 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-11-06 19:22:05,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:05,811 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:05,825 INFO L341 Elim1Store]: treesize reduction 87, result has 9.4 percent of original size [2019-11-06 19:22:05,825 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 1 case distinctions, treesize of input 271 treesize of output 193 [2019-11-06 19:22:05,826 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:05,850 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:05,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:05,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 42 treesize of output 31 [2019-11-06 19:22:05,860 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:05,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:05,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:05,883 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-11-06 19:22:06,012 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:06,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 19:22:06,014 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:06,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:06,093 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,097 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,100 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:06,114 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:06,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-11-06 19:22:06,116 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:06,221 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-06 19:22:06,221 INFO L567 ElimStorePlain]: treesize reduction 16, result has 92.7 percent of original size [2019-11-06 19:22:06,223 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,243 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:06,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:06,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-11-06 19:22:06,285 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:06,446 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-11-06 19:22:06,447 INFO L567 ElimStorePlain]: treesize reduction 132, result has 49.0 percent of original size [2019-11-06 19:22:06,447 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:06,448 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-11-06 19:22:06,523 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,525 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:06,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:06,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-11-06 19:22:06,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:06,586 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:06,735 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-11-06 19:22:06,735 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-11-06 19:22:06,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,741 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:06,744 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-11-06 19:22:06,745 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:06,783 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:06,784 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:06,784 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-11-06 19:22:07,123 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:07,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:07,220 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-11-06 19:22:07,221 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 165 treesize of output 132 [2019-11-06 19:22:07,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,224 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:07,239 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:07,311 INFO L567 ElimStorePlain]: treesize reduction 24, result has 77.4 percent of original size [2019-11-06 19:22:07,327 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:07,327 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 46 [2019-11-06 19:22:07,328 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:07,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:07,338 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:07,338 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:179, output treesize:7 [2019-11-06 19:22:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:07,362 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:07,363 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-11-06 19:22:07,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679299557] [2019-11-06 19:22:07,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 19:22:07,367 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:07,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 19:22:07,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2019-11-06 19:22:07,368 INFO L87 Difference]: Start difference. First operand 191 states and 225 transitions. Second operand 20 states. [2019-11-06 19:22:08,167 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-11-06 19:22:08,850 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-11-06 19:22:09,148 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-11-06 19:22:09,436 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 109 [2019-11-06 19:22:09,666 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-11-06 19:22:09,935 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-06 19:22:10,248 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 94 [2019-11-06 19:22:10,593 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 102 [2019-11-06 19:22:10,853 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-11-06 19:22:11,141 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 113 [2019-11-06 19:22:11,547 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-06 19:22:12,197 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-11-06 19:22:12,566 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 64 [2019-11-06 19:22:12,894 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2019-11-06 19:22:13,036 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-06 19:22:13,251 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-06 19:22:13,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:13,431 INFO L93 Difference]: Finished difference Result 752 states and 865 transitions. [2019-11-06 19:22:13,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-06 19:22:13,432 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 40 [2019-11-06 19:22:13,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:13,435 INFO L225 Difference]: With dead ends: 752 [2019-11-06 19:22:13,435 INFO L226 Difference]: Without dead ends: 750 [2019-11-06 19:22:13,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=604, Invalid=1846, Unknown=0, NotChecked=0, Total=2450 [2019-11-06 19:22:13,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2019-11-06 19:22:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 225. [2019-11-06 19:22:13,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2019-11-06 19:22:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2019-11-06 19:22:13,459 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 40 [2019-11-06 19:22:13,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:13,459 INFO L462 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2019-11-06 19:22:13,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 19:22:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2019-11-06 19:22:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 19:22:13,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:13,460 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:13,664 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:13,664 INFO L410 AbstractCegarLoop]: === Iteration 21 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:13,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:13,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1168199972, now seen corresponding path program 1 times [2019-11-06 19:22:13,665 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:13,665 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176326587] [2019-11-06 19:22:13,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:13,758 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176326587] [2019-11-06 19:22:13,758 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:22:13,758 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 19:22:13,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836263010] [2019-11-06 19:22:13,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 19:22:13,759 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:13,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 19:22:13,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:22:13,759 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand 6 states. [2019-11-06 19:22:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:13,954 INFO L93 Difference]: Finished difference Result 291 states and 342 transitions. [2019-11-06 19:22:13,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 19:22:13,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-06 19:22:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:13,956 INFO L225 Difference]: With dead ends: 291 [2019-11-06 19:22:13,956 INFO L226 Difference]: Without dead ends: 177 [2019-11-06 19:22:13,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-06 19:22:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-11-06 19:22:13,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2019-11-06 19:22:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2019-11-06 19:22:13,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 200 transitions. [2019-11-06 19:22:13,970 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 200 transitions. Word has length 42 [2019-11-06 19:22:13,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:13,970 INFO L462 AbstractCegarLoop]: Abstraction has 176 states and 200 transitions. [2019-11-06 19:22:13,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 19:22:13,970 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 200 transitions. [2019-11-06 19:22:13,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-06 19:22:13,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:13,971 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:13,971 INFO L410 AbstractCegarLoop]: === Iteration 22 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:13,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:13,972 INFO L82 PathProgramCache]: Analyzing trace with hash 608870837, now seen corresponding path program 1 times [2019-11-06 19:22:13,972 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:13,972 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076430410] [2019-11-06 19:22:13,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:14,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:14,542 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:14,542 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076430410] [2019-11-06 19:22:14,542 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191322117] [2019-11-06 19:22:14,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:14,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:14,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 46 conjunts are in the unsatisfiable core [2019-11-06 19:22:14,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:14,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:22:14,655 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:14,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:14,658 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:14,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-06 19:22:14,685 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:14,686 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-11-06 19:22:14,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:14,756 INFO L567 ElimStorePlain]: treesize reduction 14, result has 96.3 percent of original size [2019-11-06 19:22:14,758 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:14,774 INFO L341 Elim1Store]: treesize reduction 89, result has 7.3 percent of original size [2019-11-06 19:22:14,774 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 1 case distinctions, treesize of input 141 treesize of output 130 [2019-11-06 19:22:14,775 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:14,802 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:14,805 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:14,807 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 42 treesize of output 31 [2019-11-06 19:22:14,807 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:14,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:14,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:14,830 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:362, output treesize:91 [2019-11-06 19:22:14,942 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:14,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-11-06 19:22:14,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:15,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:15,017 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,027 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,040 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:15,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,045 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:15,080 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:15,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 135 treesize of output 137 [2019-11-06 19:22:15,083 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:15,251 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2019-11-06 19:22:15,252 INFO L567 ElimStorePlain]: treesize reduction 132, result has 59.4 percent of original size [2019-11-06 19:22:15,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,272 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:15,273 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 85 [2019-11-06 19:22:15,274 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:15,381 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-11-06 19:22:15,382 INFO L567 ElimStorePlain]: treesize reduction 16, result has 88.8 percent of original size [2019-11-06 19:22:15,383 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:15,383 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:276, output treesize:140 [2019-11-06 19:22:15,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,485 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:22:15,524 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:15,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 16 case distinctions, treesize of input 157 treesize of output 183 [2019-11-06 19:22:15,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:15,552 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:15,678 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-11-06 19:22:15,679 INFO L567 ElimStorePlain]: treesize reduction 114, result has 54.9 percent of original size [2019-11-06 19:22:15,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,689 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:22:15,691 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 82 [2019-11-06 19:22:15,692 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:15,729 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:15,730 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:15,730 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 [2019-11-06 19:22:16,105 INFO L341 Elim1Store]: treesize reduction 16, result has 76.5 percent of original size [2019-11-06 19:22:16,105 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 3 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 27 case distinctions, treesize of input 161 treesize of output 130 [2019-11-06 19:22:16,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,123 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:16,143 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:16,215 INFO L567 ElimStorePlain]: treesize reduction 32, result has 71.4 percent of original size [2019-11-06 19:22:16,226 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:16,227 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 9 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 44 [2019-11-06 19:22:16,227 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:22:16,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:16,237 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:22:16,237 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:175, output treesize:7 [2019-11-06 19:22:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:16,267 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:22:16,267 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-11-06 19:22:16,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320266651] [2019-11-06 19:22:16,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 19:22:16,268 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:22:16,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 19:22:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-11-06 19:22:16,269 INFO L87 Difference]: Start difference. First operand 176 states and 200 transitions. Second operand 20 states. [2019-11-06 19:22:16,957 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2019-11-06 19:22:17,410 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-11-06 19:22:17,682 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 97 [2019-11-06 19:22:17,969 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 111 [2019-11-06 19:22:18,193 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 99 [2019-11-06 19:22:18,680 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 103 [2019-11-06 19:22:19,013 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 73 [2019-11-06 19:22:19,288 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 115 [2019-11-06 19:22:19,629 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 103 [2019-11-06 19:22:19,866 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-06 19:22:20,205 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-06 19:22:20,742 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-11-06 19:22:20,891 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-06 19:22:21,267 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-11-06 19:22:21,592 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-11-06 19:22:21,852 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-06 19:22:22,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:22:22,143 INFO L93 Difference]: Finished difference Result 579 states and 633 transitions. [2019-11-06 19:22:22,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-11-06 19:22:22,145 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 43 [2019-11-06 19:22:22,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:22:22,148 INFO L225 Difference]: With dead ends: 579 [2019-11-06 19:22:22,148 INFO L226 Difference]: Without dead ends: 577 [2019-11-06 19:22:22,150 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=664, Invalid=1988, Unknown=0, NotChecked=0, Total=2652 [2019-11-06 19:22:22,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-06 19:22:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 203. [2019-11-06 19:22:22,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-06 19:22:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 233 transitions. [2019-11-06 19:22:22,167 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 233 transitions. Word has length 43 [2019-11-06 19:22:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:22:22,167 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 233 transitions. [2019-11-06 19:22:22,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 19:22:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 233 transitions. [2019-11-06 19:22:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 19:22:22,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:22:22,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:22:22,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:22,373 INFO L410 AbstractCegarLoop]: === Iteration 23 === [mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:22:22,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:22:22,373 INFO L82 PathProgramCache]: Analyzing trace with hash 938403788, now seen corresponding path program 1 times [2019-11-06 19:22:22,374 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:22:22,374 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361839231] [2019-11-06 19:22:22,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:22:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:22,748 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 38 [2019-11-06 19:22:23,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:23,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:22:23,065 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361839231] [2019-11-06 19:22:23,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [580055516] [2019-11-06 19:22:23,066 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-11-06 19:22:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:22:23,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-06 19:22:23,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:22:23,332 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:23,333 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 69 treesize of output 54 [2019-11-06 19:22:23,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:23,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:22:23,335 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:22:23,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:22:23,550 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:22:23,552 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:178) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:83) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:294) ... 21 more [2019-11-06 19:22:23,557 INFO L168 Benchmark]: Toolchain (without parser) took 35890.17 ms. Allocated memory was 139.5 MB in the beginning and 474.5 MB in the end (delta: 335.0 MB). Free memory was 102.1 MB in the beginning and 318.0 MB in the end (delta: -216.0 MB). Peak memory consumption was 119.1 MB. Max. memory is 7.1 GB. [2019-11-06 19:22:23,557 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 139.5 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 19:22:23,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.74 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 171.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. [2019-11-06 19:22:23,558 INFO L168 Benchmark]: Boogie Preprocessor took 69.93 ms. Allocated memory is still 204.5 MB. Free memory was 171.1 MB in the beginning and 167.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. [2019-11-06 19:22:23,558 INFO L168 Benchmark]: RCFGBuilder took 794.71 ms. Allocated memory is still 204.5 MB. Free memory was 167.2 MB in the beginning and 112.8 MB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. [2019-11-06 19:22:23,559 INFO L168 Benchmark]: TraceAbstraction took 34415.25 ms. Allocated memory was 204.5 MB in the beginning and 474.5 MB in the end (delta: 270.0 MB). Free memory was 111.9 MB in the beginning and 318.0 MB in the end (delta: -206.2 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. [2019-11-06 19:22:23,561 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46 ms. Allocated memory is still 139.5 MB. Free memory is still 121.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 605.74 ms. Allocated memory was 139.5 MB in the beginning and 204.5 MB in the end (delta: 65.0 MB). Free memory was 101.7 MB in the beginning and 171.1 MB in the end (delta: -69.5 MB). Peak memory consumption was 25.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.93 ms. Allocated memory is still 204.5 MB. Free memory was 171.1 MB in the beginning and 167.2 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 794.71 ms. Allocated memory is still 204.5 MB. Free memory was 167.2 MB in the beginning and 112.8 MB in the end (delta: 54.4 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34415.25 ms. Allocated memory was 204.5 MB in the beginning and 474.5 MB in the end (delta: 270.0 MB). Free memory was 111.9 MB in the beginning and 318.0 MB in the end (delta: -206.2 MB). Peak memory consumption was 63.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: java.lang.UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: java.lang.UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:302) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...