/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 12:03:52,215 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 12:03:52,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 12:03:52,239 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 12:03:52,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 12:03:52,242 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 12:03:52,244 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 12:03:52,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 12:03:52,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 12:03:52,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 12:03:52,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 12:03:52,267 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 12:03:52,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 12:03:52,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 12:03:52,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 12:03:52,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 12:03:52,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 12:03:52,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 12:03:52,277 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 12:03:52,282 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 12:03:52,287 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 12:03:52,291 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 12:03:52,292 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 12:03:52,293 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 12:03:52,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 12:03:52,295 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 12:03:52,296 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 12:03:52,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 12:03:52,299 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 12:03:52,300 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 12:03:52,301 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 12:03:52,302 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 12:03:52,303 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 12:03:52,303 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 12:03:52,305 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 12:03:52,305 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 12:03:52,305 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 12:03:52,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 12:03:52,306 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 12:03:52,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 12:03:52,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 12:03:52,310 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 [2020-07-17 12:03:52,334 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 12:03:52,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 12:03:52,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 12:03:52,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 12:03:52,339 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 12:03:52,339 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 12:03:52,339 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 12:03:52,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 12:03:52,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 12:03:52,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 12:03:52,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 12:03:52,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 12:03:52,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 12:03:52,342 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 12:03:52,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 12:03:52,343 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 12:03:52,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 12:03:52,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 12:03:52,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 12:03:52,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 12:03:52,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 12:03:52,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 12:03:52,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 12:03:52,346 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 12:03:52,346 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 12:03:52,346 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 12:03:52,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 12:03:52,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 12:03:52,347 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 12:03:52,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 12:03:52,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 12:03:52,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 12:03:52,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 12:03:52,651 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 12:03:52,651 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 12:03:52,652 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-17 12:03:52,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8357618e6/c4f35cff8aa54c6f991142ecb1ff05fc/FLAG87a511703 [2020-07-17 12:03:53,311 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 12:03:53,312 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-17 12:03:53,329 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8357618e6/c4f35cff8aa54c6f991142ecb1ff05fc/FLAG87a511703 [2020-07-17 12:03:53,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8357618e6/c4f35cff8aa54c6f991142ecb1ff05fc [2020-07-17 12:03:53,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 12:03:53,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 12:03:53,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 12:03:53,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 12:03:53,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 12:03:53,592 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 12:03:53" (1/1) ... [2020-07-17 12:03:53,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74d456c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:53, skipping insertion in model container [2020-07-17 12:03:53,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 12:03:53" (1/1) ... [2020-07-17 12:03:53,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 12:03:53,671 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 12:03:54,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 12:03:54,164 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 12:03:54,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 12:03:54,290 INFO L208 MainTranslator]: Completed translation [2020-07-17 12:03:54,290 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54 WrapperNode [2020-07-17 12:03:54,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 12:03:54,291 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 12:03:54,291 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 12:03:54,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 12:03:54,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (1/1) ... [2020-07-17 12:03:54,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (1/1) ... [2020-07-17 12:03:54,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (1/1) ... [2020-07-17 12:03:54,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (1/1) ... [2020-07-17 12:03:54,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (1/1) ... [2020-07-17 12:03:54,359 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (1/1) ... [2020-07-17 12:03:54,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (1/1) ... [2020-07-17 12:03:54,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 12:03:54,372 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 12:03:54,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 12:03:54,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 12:03:54,373 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (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 [2020-07-17 12:03:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 12:03:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 12:03:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 12:03:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 12:03:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-17 12:03:54,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 12:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 12:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 12:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 12:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 12:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 12:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 12:03:54,430 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 12:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 12:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 12:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 12:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 12:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 12:03:54,431 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 12:03:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 12:03:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 12:03:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 12:03:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 12:03:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 12:03:54,432 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 12:03:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 12:03:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 12:03:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 12:03:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 12:03:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 12:03:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 12:03:54,433 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 12:03:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 12:03:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 12:03:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 12:03:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 12:03:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 12:03:54,434 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 12:03:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 12:03:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 12:03:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 12:03:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 12:03:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 12:03:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 12:03:54,435 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 12:03:54,436 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 12:03:54,437 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 12:03:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 12:03:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-17 12:03:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 12:03:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 12:03:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 12:03:54,438 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 12:03:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 12:03:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 12:03:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 12:03:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 12:03:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 12:03:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 12:03:54,439 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 12:03:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 12:03:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 12:03:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 12:03:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 12:03:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 12:03:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 12:03:54,440 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 12:03:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 12:03:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 12:03:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 12:03:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 12:03:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 12:03:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 12:03:54,441 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 12:03:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 12:03:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 12:03:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 12:03:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 12:03:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 12:03:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 12:03:54,442 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 12:03:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 12:03:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 12:03:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 12:03:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 12:03:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 12:03:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 12:03:54,443 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 12:03:54,444 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 12:03:54,445 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 12:03:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 12:03:54,446 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 12:03:54,851 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-17 12:03:55,159 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 12:03:55,159 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-17 12:03:55,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 12:03:55 BoogieIcfgContainer [2020-07-17 12:03:55,164 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 12:03:55,165 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 12:03:55,165 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 12:03:55,169 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 12:03:55,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 12:03:53" (1/3) ... [2020-07-17 12:03:55,170 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a185077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 12:03:55, skipping insertion in model container [2020-07-17 12:03:55,170 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 12:03:54" (2/3) ... [2020-07-17 12:03:55,171 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a185077 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 12:03:55, skipping insertion in model container [2020-07-17 12:03:55,171 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 12:03:55" (3/3) ... [2020-07-17 12:03:55,173 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-07-17 12:03:55,184 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 12:03:55,193 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 12:03:55,207 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 12:03:55,232 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 12:03:55,232 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 12:03:55,232 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 12:03:55,234 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 12:03:55,234 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 12:03:55,234 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 12:03:55,235 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 12:03:55,235 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 12:03:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-07-17 12:03:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 12:03:55,262 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:55,263 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:03:55,264 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:55,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:55,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1575706012, now seen corresponding path program 1 times [2020-07-17 12:03:55,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:55,281 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570911729] [2020-07-17 12:03:55,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:55,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:55,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 12:03:55,485 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570911729] [2020-07-17 12:03:55,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 12:03:55,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 12:03:55,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936405313] [2020-07-17 12:03:55,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 12:03:55,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:55,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 12:03:55,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 12:03:55,506 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-17 12:03:55,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:55,771 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2020-07-17 12:03:55,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 12:03:55,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-17 12:03:55,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:55,784 INFO L225 Difference]: With dead ends: 108 [2020-07-17 12:03:55,784 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 12:03:55,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 12:03:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 12:03:55,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-17 12:03:55,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-17 12:03:55,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2020-07-17 12:03:55,835 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2020-07-17 12:03:55,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:55,835 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2020-07-17 12:03:55,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 12:03:55,836 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-07-17 12:03:55,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 12:03:55,837 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:55,837 INFO L422 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] [2020-07-17 12:03:55,838 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 12:03:55,838 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:55,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:55,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1627887593, now seen corresponding path program 1 times [2020-07-17 12:03:55,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:55,839 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914784828] [2020-07-17 12:03:55,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:55,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 12:03:55,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914784828] [2020-07-17 12:03:55,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 12:03:55,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 12:03:55,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969693722] [2020-07-17 12:03:55,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 12:03:55,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:55,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 12:03:55,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 12:03:55,923 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 4 states. [2020-07-17 12:03:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:56,083 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-07-17 12:03:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 12:03:56,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-17 12:03:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:56,087 INFO L225 Difference]: With dead ends: 75 [2020-07-17 12:03:56,087 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 12:03:56,089 INFO L675 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 [2020-07-17 12:03:56,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 12:03:56,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-17 12:03:56,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 12:03:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2020-07-17 12:03:56,111 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2020-07-17 12:03:56,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:56,111 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2020-07-17 12:03:56,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 12:03:56,112 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-07-17 12:03:56,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 12:03:56,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:56,116 INFO L422 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] [2020-07-17 12:03:56,116 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 12:03:56,116 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:56,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:56,117 INFO L82 PathProgramCache]: Analyzing trace with hash -164754602, now seen corresponding path program 1 times [2020-07-17 12:03:56,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:56,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874091606] [2020-07-17 12:03:56,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:56,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:56,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 12:03:56,177 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874091606] [2020-07-17 12:03:56,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 12:03:56,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 12:03:56,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196962997] [2020-07-17 12:03:56,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 12:03:56,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:56,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 12:03:56,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 12:03:56,180 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 4 states. [2020-07-17 12:03:56,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:56,302 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2020-07-17 12:03:56,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 12:03:56,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-17 12:03:56,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:56,303 INFO L225 Difference]: With dead ends: 93 [2020-07-17 12:03:56,303 INFO L226 Difference]: Without dead ends: 57 [2020-07-17 12:03:56,304 INFO L675 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 [2020-07-17 12:03:56,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-17 12:03:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-17 12:03:56,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-17 12:03:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2020-07-17 12:03:56,312 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2020-07-17 12:03:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:56,312 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2020-07-17 12:03:56,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 12:03:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-07-17 12:03:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 12:03:56,314 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:56,314 INFO L422 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] [2020-07-17 12:03:56,314 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 12:03:56,314 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:56,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:56,315 INFO L82 PathProgramCache]: Analyzing trace with hash -982403052, now seen corresponding path program 1 times [2020-07-17 12:03:56,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:56,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669259659] [2020-07-17 12:03:56,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:56,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:56,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:56,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:56,431 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669259659] [2020-07-17 12:03:56,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 12:03:56,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 12:03:56,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803933117] [2020-07-17 12:03:56,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 12:03:56,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:56,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 12:03:56,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 12:03:56,434 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 6 states. [2020-07-17 12:03:56,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:56,645 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2020-07-17 12:03:56,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 12:03:56,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-17 12:03:56,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:56,647 INFO L225 Difference]: With dead ends: 82 [2020-07-17 12:03:56,647 INFO L226 Difference]: Without dead ends: 78 [2020-07-17 12:03:56,648 INFO L675 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 [2020-07-17 12:03:56,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-17 12:03:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2020-07-17 12:03:56,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-17 12:03:56,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-07-17 12:03:56,656 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2020-07-17 12:03:56,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:56,657 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-07-17 12:03:56,657 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 12:03:56,657 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-07-17 12:03:56,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 12:03:56,658 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:56,659 INFO L422 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] [2020-07-17 12:03:56,659 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 12:03:56,659 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:56,660 INFO L82 PathProgramCache]: Analyzing trace with hash 852152367, now seen corresponding path program 1 times [2020-07-17 12:03:56,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:56,660 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337759512] [2020-07-17 12:03:56,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:56,743 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337759512] [2020-07-17 12:03:56,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 12:03:56,744 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 12:03:56,744 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420018736] [2020-07-17 12:03:56,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 12:03:56,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:56,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 12:03:56,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 12:03:56,746 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 6 states. [2020-07-17 12:03:56,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:56,956 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-07-17 12:03:56,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 12:03:56,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-17 12:03:56,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:56,958 INFO L225 Difference]: With dead ends: 84 [2020-07-17 12:03:56,958 INFO L226 Difference]: Without dead ends: 76 [2020-07-17 12:03:56,959 INFO L675 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 [2020-07-17 12:03:56,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-17 12:03:56,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2020-07-17 12:03:56,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-17 12:03:56,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2020-07-17 12:03:56,970 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2020-07-17 12:03:56,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:56,972 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2020-07-17 12:03:56,972 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 12:03:56,972 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2020-07-17 12:03:56,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-17 12:03:56,976 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:56,976 INFO L422 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] [2020-07-17 12:03:56,976 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 12:03:56,976 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:56,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:56,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1876855343, now seen corresponding path program 1 times [2020-07-17 12:03:56,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:56,977 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294763925] [2020-07-17 12:03:56,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:57,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:57,074 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294763925] [2020-07-17 12:03:57,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 12:03:57,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-17 12:03:57,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862653187] [2020-07-17 12:03:57,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 12:03:57,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:57,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 12:03:57,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 12:03:57,076 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 6 states. [2020-07-17 12:03:57,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:57,259 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-07-17 12:03:57,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 12:03:57,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-17 12:03:57,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:57,261 INFO L225 Difference]: With dead ends: 84 [2020-07-17 12:03:57,261 INFO L226 Difference]: Without dead ends: 73 [2020-07-17 12:03:57,262 INFO L675 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 [2020-07-17 12:03:57,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-17 12:03:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-07-17 12:03:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-17 12:03:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2020-07-17 12:03:57,268 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2020-07-17 12:03:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:57,269 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2020-07-17 12:03:57,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 12:03:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2020-07-17 12:03:57,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 12:03:57,270 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:57,270 INFO L422 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] [2020-07-17 12:03:57,270 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 12:03:57,270 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:57,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:57,271 INFO L82 PathProgramCache]: Analyzing trace with hash -778946181, now seen corresponding path program 1 times [2020-07-17 12:03:57,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:57,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594729821] [2020-07-17 12:03:57,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:57,400 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:57,400 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594729821] [2020-07-17 12:03:57,401 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28515163] [2020-07-17 12:03:57,401 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 [2020-07-17 12:03:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:57,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-17 12:03:57,542 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:03:57,645 INFO L384 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 [2020-07-17 12:03:57,646 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,651 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:57,652 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,652 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-17 12:03:57,683 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:57,684 INFO L384 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 [2020-07-17 12:03:57,685 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,695 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:57,700 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:03:57,701 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,709 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:57,710 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,710 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-07-17 12:03:57,737 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-17 12:03:57,737 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 12:03:57,738 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,743 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:57,743 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,744 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-07-17 12:03:57,753 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-17 12:03:57,754 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,761 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:57,762 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 12:03:57,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-07-17 12:03:57,793 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-17 12:03:57,794 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,798 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:57,799 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:57,800 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-17 12:03:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:57,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:03:57,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-17 12:03:57,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730073658] [2020-07-17 12:03:57,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 12:03:57,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:57,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 12:03:57,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-17 12:03:57,806 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 10 states. [2020-07-17 12:03:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:58,204 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-07-17 12:03:58,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 12:03:58,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-17 12:03:58,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:58,205 INFO L225 Difference]: With dead ends: 86 [2020-07-17 12:03:58,205 INFO L226 Difference]: Without dead ends: 80 [2020-07-17 12:03:58,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-07-17 12:03:58,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-17 12:03:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-07-17 12:03:58,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-17 12:03:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2020-07-17 12:03:58,213 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 35 [2020-07-17 12:03:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:58,213 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2020-07-17 12:03:58,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 12:03:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2020-07-17 12:03:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-17 12:03:58,214 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:58,215 INFO L422 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] [2020-07-17 12:03:58,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 12:03:58,416 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:58,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:58,417 INFO L82 PathProgramCache]: Analyzing trace with hash 84455483, now seen corresponding path program 1 times [2020-07-17 12:03:58,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:58,418 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093173041] [2020-07-17 12:03:58,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:58,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:58,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093173041] [2020-07-17 12:03:58,520 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796656542] [2020-07-17 12:03:58,521 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 [2020-07-17 12:03:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:58,634 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-17 12:03:58,637 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:03:58,650 INFO L384 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 [2020-07-17 12:03:58,650 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,653 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:58,653 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,653 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-17 12:03:58,670 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:58,671 INFO L384 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 [2020-07-17 12:03:58,672 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,681 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:58,686 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:03:58,686 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,694 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:58,695 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,695 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-07-17 12:03:58,714 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-17 12:03:58,715 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 12:03:58,715 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,720 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:58,721 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,721 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-07-17 12:03:58,730 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-17 12:03:58,731 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,737 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:58,739 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 12:03:58,739 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-07-17 12:03:58,769 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-17 12:03:58,770 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,774 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:58,775 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:58,775 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-17 12:03:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:58,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:03:58,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2020-07-17 12:03:58,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135190863] [2020-07-17 12:03:58,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 12:03:58,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:58,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 12:03:58,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2020-07-17 12:03:58,781 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 10 states. [2020-07-17 12:03:59,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:03:59,162 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-07-17 12:03:59,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 12:03:59,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2020-07-17 12:03:59,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:03:59,166 INFO L225 Difference]: With dead ends: 95 [2020-07-17 12:03:59,167 INFO L226 Difference]: Without dead ends: 91 [2020-07-17 12:03:59,167 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2020-07-17 12:03:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-17 12:03:59,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2020-07-17 12:03:59,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-17 12:03:59,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2020-07-17 12:03:59,180 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2020-07-17 12:03:59,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:03:59,183 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2020-07-17 12:03:59,183 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 12:03:59,183 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2020-07-17 12:03:59,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 12:03:59,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:03:59,184 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:03:59,384 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:03:59,385 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:03:59,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:03:59,385 INFO L82 PathProgramCache]: Analyzing trace with hash -169587242, now seen corresponding path program 1 times [2020-07-17 12:03:59,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:03:59,386 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489786423] [2020-07-17 12:03:59,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:03:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:59,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:59,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489786423] [2020-07-17 12:03:59,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379878350] [2020-07-17 12:03:59,583 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 [2020-07-17 12:03:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:03:59,679 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-17 12:03:59,682 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:03:59,689 INFO L384 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 [2020-07-17 12:03:59,690 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,692 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,692 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,692 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-17 12:03:59,730 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,731 INFO L384 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 [2020-07-17 12:03:59,732 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,737 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,737 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,738 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-07-17 12:03:59,762 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-17 12:03:59,763 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,772 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,778 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-17 12:03:59,778 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,787 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,788 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,788 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-07-17 12:03:59,820 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2020-07-17 12:03:59,825 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-07-17 12:03:59,826 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,835 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,856 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,857 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2020-07-17 12:03:59,860 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-17 12:03:59,860 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 12:03:59,861 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,877 INFO L624 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-07-17 12:03:59,880 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2020-07-17 12:03:59,881 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,892 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,892 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,892 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-07-17 12:03:59,920 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-07-17 12:03:59,921 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,928 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,930 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-07-17 12:03:59,931 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,936 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,937 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,937 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-07-17 12:03:59,941 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-17 12:03:59,942 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,944 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:03:59,944 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:03:59,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 12:03:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:03:59,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:03:59,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2020-07-17 12:03:59,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827919715] [2020-07-17 12:03:59,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-17 12:03:59,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:03:59,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-17 12:03:59,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2020-07-17 12:03:59,951 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 15 states. [2020-07-17 12:04:00,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:04:00,571 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-17 12:04:00,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 12:04:00,572 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 37 [2020-07-17 12:04:00,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:04:00,573 INFO L225 Difference]: With dead ends: 99 [2020-07-17 12:04:00,574 INFO L226 Difference]: Without dead ends: 95 [2020-07-17 12:04:00,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-17 12:04:00,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-17 12:04:00,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2020-07-17 12:04:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-17 12:04:00,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2020-07-17 12:04:00,582 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2020-07-17 12:04:00,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:04:00,582 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2020-07-17 12:04:00,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-17 12:04:00,583 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2020-07-17 12:04:00,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 12:04:00,584 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:04:00,584 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:04:00,788 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:00,789 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:04:00,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:04:00,790 INFO L82 PathProgramCache]: Analyzing trace with hash 284097905, now seen corresponding path program 1 times [2020-07-17 12:04:00,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:04:00,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814202593] [2020-07-17 12:04:00,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:04:00,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:01,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:01,031 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814202593] [2020-07-17 12:04:01,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728743795] [2020-07-17 12:04:01,034 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 [2020-07-17 12:04:01,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:01,132 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-17 12:04:01,145 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:04:01,157 INFO L384 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 [2020-07-17 12:04:01,157 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,160 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,160 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,160 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-17 12:04:01,206 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,206 INFO L384 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 [2020-07-17 12:04:01,207 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,212 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,213 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-07-17 12:04:01,240 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-17 12:04:01,241 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,252 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,257 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2020-07-17 12:04:01,258 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,267 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,268 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,269 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-07-17 12:04:01,295 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2020-07-17 12:04:01,299 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2020-07-17 12:04:01,299 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,310 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,337 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,337 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 132 [2020-07-17 12:04:01,339 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-17 12:04:01,340 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 12:04:01,341 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,360 INFO L624 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-07-17 12:04:01,364 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 49 [2020-07-17 12:04:01,365 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,369 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,369 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,369 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-07-17 12:04:01,404 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2020-07-17 12:04:01,405 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,411 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,417 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2020-07-17 12:04:01,418 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,429 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,430 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,430 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-07-17 12:04:01,440 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-17 12:04:01,441 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,448 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:01,448 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:01,449 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 12:04:01,472 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:01,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:04:01,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2020-07-17 12:04:01,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408007336] [2020-07-17 12:04:01,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 12:04:01,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:04:01,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 12:04:01,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2020-07-17 12:04:01,476 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 16 states. [2020-07-17 12:04:02,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:04:02,084 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2020-07-17 12:04:02,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 12:04:02,085 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 39 [2020-07-17 12:04:02,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:04:02,087 INFO L225 Difference]: With dead ends: 101 [2020-07-17 12:04:02,087 INFO L226 Difference]: Without dead ends: 91 [2020-07-17 12:04:02,088 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=342, Unknown=0, NotChecked=0, Total=420 [2020-07-17 12:04:02,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-17 12:04:02,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2020-07-17 12:04:02,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-17 12:04:02,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2020-07-17 12:04:02,096 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 39 [2020-07-17 12:04:02,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:04:02,097 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2020-07-17 12:04:02,097 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 12:04:02,097 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2020-07-17 12:04:02,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 12:04:02,098 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:04:02,098 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:04:02,305 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:02,305 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:04:02,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:04:02,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1308800881, now seen corresponding path program 2 times [2020-07-17 12:04:02,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:04:02,307 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926846074] [2020-07-17 12:04:02,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:04:02,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:02,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:02,526 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926846074] [2020-07-17 12:04:02,527 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378741266] [2020-07-17 12:04:02,527 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:02,624 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 12:04:02,624 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 12:04:02,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-17 12:04:02,628 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:04:02,638 INFO L384 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 [2020-07-17 12:04:02,639 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,642 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,643 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,643 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 12:04:02,658 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,658 INFO L384 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 [2020-07-17 12:04:02,659 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,676 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,677 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,677 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-17 12:04:02,689 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:04:02,689 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,700 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,708 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:04:02,709 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,721 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,722 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,722 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-17 12:04:02,738 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2020-07-17 12:04:02,743 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2020-07-17 12:04:02,743 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,759 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,779 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,779 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 108 [2020-07-17 12:04:02,781 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-17 12:04:02,781 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-17 12:04:02,782 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,800 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-17 12:04:02,804 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 41 [2020-07-17 12:04:02,805 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,813 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,814 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,814 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-17 12:04:02,840 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2020-07-17 12:04:02,841 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,848 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,851 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-07-17 12:04:02,852 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,855 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,856 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,856 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-17 12:04:02,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-17 12:04:02,860 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,862 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:02,862 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:02,863 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-17 12:04:02,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:02,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:04:02,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 12 [2020-07-17 12:04:02,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087454047] [2020-07-17 12:04:02,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-17 12:04:02,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:04:02,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-17 12:04:02,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2020-07-17 12:04:02,882 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 12 states. [2020-07-17 12:04:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:04:03,305 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2020-07-17 12:04:03,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 12:04:03,305 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 39 [2020-07-17 12:04:03,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:04:03,306 INFO L225 Difference]: With dead ends: 94 [2020-07-17 12:04:03,307 INFO L226 Difference]: Without dead ends: 81 [2020-07-17 12:04:03,308 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-07-17 12:04:03,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-17 12:04:03,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2020-07-17 12:04:03,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-17 12:04:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2020-07-17 12:04:03,314 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 39 [2020-07-17 12:04:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:04:03,314 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2020-07-17 12:04:03,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-17 12:04:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2020-07-17 12:04:03,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 12:04:03,316 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:04:03,316 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:04:03,525 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-17 12:04:03,526 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:04:03,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:04:03,527 INFO L82 PathProgramCache]: Analyzing trace with hash -315248798, now seen corresponding path program 2 times [2020-07-17 12:04:03,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:04:03,527 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448547945] [2020-07-17 12:04:03,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:04:03,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:03,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448547945] [2020-07-17 12:04:03,727 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751348568] [2020-07-17 12:04:03,728 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:03,856 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 12:04:03,856 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 12:04:03,858 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-17 12:04:03,860 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:04:03,869 INFO L384 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 [2020-07-17 12:04:03,869 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:03,873 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:03,874 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:03,874 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 12:04:03,900 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:03,901 INFO L384 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 [2020-07-17 12:04:03,901 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:03,932 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-17 12:04:03,936 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:04:03,936 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:03,948 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:03,949 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:03,950 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-17 12:04:03,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 12:04:03,994 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 12:04:03,994 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,001 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:04,002 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,002 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-17 12:04:04,061 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:04,061 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-17 12:04:04,062 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,072 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:04,076 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-17 12:04:04,077 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,087 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:04,087 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,087 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-17 12:04:04,120 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-17 12:04:04,121 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-17 12:04:04,141 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-17 12:04:04,142 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-07-17 12:04:04,142 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,151 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:04,153 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 12:04:04,153 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-17 12:04:04,196 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-07-17 12:04:04,197 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,213 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:04,217 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-17 12:04:04,217 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-17 12:04:04,276 INFO L384 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 [2020-07-17 12:04:04,277 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,284 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:04,285 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:04,285 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-17 12:04:04,309 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:04,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:04:04,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-17 12:04:04,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094841806] [2020-07-17 12:04:04,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-17 12:04:04,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:04:04,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-17 12:04:04,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2020-07-17 12:04:04,311 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 19 states. [2020-07-17 12:04:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:04:05,096 INFO L93 Difference]: Finished difference Result 105 states and 135 transitions. [2020-07-17 12:04:05,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 12:04:05,096 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2020-07-17 12:04:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:04:05,098 INFO L225 Difference]: With dead ends: 105 [2020-07-17 12:04:05,098 INFO L226 Difference]: Without dead ends: 97 [2020-07-17 12:04:05,099 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2020-07-17 12:04:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2020-07-17 12:04:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 87. [2020-07-17 12:04:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-17 12:04:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2020-07-17 12:04:05,104 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 39 [2020-07-17 12:04:05,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:04:05,105 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-07-17 12:04:05,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-17 12:04:05,105 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2020-07-17 12:04:05,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-17 12:04:05,105 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:04:05,106 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:04:05,306 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:05,307 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:04:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:04:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -15546846, now seen corresponding path program 1 times [2020-07-17 12:04:05,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:04:05,308 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142224562] [2020-07-17 12:04:05,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:04:05,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:05,499 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:05,499 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142224562] [2020-07-17 12:04:05,500 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873368027] [2020-07-17 12:04:05,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:05,615 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-17 12:04:05,618 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:04:05,633 INFO L384 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 [2020-07-17 12:04:05,633 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,635 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,635 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,636 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-17 12:04:05,685 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,686 INFO L384 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 [2020-07-17 12:04:05,686 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,713 INFO L624 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-07-17 12:04:05,718 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:04:05,718 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,729 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,730 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,730 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-07-17 12:04:05,777 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-17 12:04:05,778 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2020-07-17 12:04:05,778 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,785 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,786 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,786 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-07-17 12:04:05,828 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,829 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2020-07-17 12:04:05,829 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,837 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,841 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-07-17 12:04:05,842 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,852 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,852 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,853 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-07-17 12:04:05,885 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-17 12:04:05,885 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-17 12:04:05,922 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-17 12:04:05,923 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2020-07-17 12:04:05,923 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:05,932 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:05,933 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 12:04:05,933 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-07-17 12:04:05,991 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-07-17 12:04:05,992 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:06,002 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:06,004 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-17 12:04:06,005 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-07-17 12:04:06,061 INFO L384 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 [2020-07-17 12:04:06,062 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:06,069 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:06,069 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:06,069 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-07-17 12:04:06,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:06,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:04:06,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2020-07-17 12:04:06,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327651025] [2020-07-17 12:04:06,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 12:04:06,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:04:06,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 12:04:06,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2020-07-17 12:04:06,095 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand 21 states. [2020-07-17 12:04:07,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:04:07,170 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2020-07-17 12:04:07,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-17 12:04:07,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2020-07-17 12:04:07,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:04:07,172 INFO L225 Difference]: With dead ends: 125 [2020-07-17 12:04:07,172 INFO L226 Difference]: Without dead ends: 119 [2020-07-17 12:04:07,173 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=195, Invalid=995, Unknown=0, NotChecked=0, Total=1190 [2020-07-17 12:04:07,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-07-17 12:04:07,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 95. [2020-07-17 12:04:07,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-17 12:04:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2020-07-17 12:04:07,178 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 39 [2020-07-17 12:04:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:04:07,179 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2020-07-17 12:04:07,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 12:04:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2020-07-17 12:04:07,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-17 12:04:07,179 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:04:07,180 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:04:07,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:07,381 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:04:07,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:04:07,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1233000963, now seen corresponding path program 3 times [2020-07-17 12:04:07,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:04:07,382 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856406136] [2020-07-17 12:04:07,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:04:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:07,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 12:04:07,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:07,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856406136] [2020-07-17 12:04:07,705 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317930807] [2020-07-17 12:04:07,705 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 12:04:07,835 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-17 12:04:07,835 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 12:04:07,836 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 63 conjunts are in the unsatisfiable core [2020-07-17 12:04:07,841 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 12:04:07,846 INFO L384 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 [2020-07-17 12:04:07,847 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:07,850 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:07,850 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:07,851 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-17 12:04:07,873 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:07,874 INFO L384 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 [2020-07-17 12:04:07,875 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 12:04:07,878 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:07,906 INFO L624 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2020-07-17 12:04:07,907 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:07,907 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2020-07-17 12:04:07,947 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:04:07,947 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:07,963 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:07,970 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:04:07,970 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:07,986 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:07,987 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:07,987 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:54, output treesize:47 [2020-07-17 12:04:08,057 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,058 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 30 [2020-07-17 12:04:08,058 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 12:04:08,058 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 12:04:08,059 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,085 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,087 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_49|]} [2020-07-17 12:04:08,096 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 12:04:08,097 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,121 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 12:04:08,129 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 19 [2020-07-17 12:04:08,129 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,149 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,155 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2020-07-17 12:04:08,155 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,172 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,173 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,173 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:96, output treesize:47 [2020-07-17 12:04:08,234 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-17 12:04:08,243 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,244 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 155 treesize of output 129 [2020-07-17 12:04:08,245 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 1] term [2020-07-17 12:04:08,246 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-17 12:04:08,246 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,309 INFO L624 ElimStorePlain]: treesize reduction 24, result has 86.4 percent of original size [2020-07-17 12:04:08,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 12:04:08,317 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2020-07-17 12:04:08,317 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,340 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,360 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,361 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 109 [2020-07-17 12:04:08,362 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,404 INFO L624 ElimStorePlain]: treesize reduction 24, result has 76.5 percent of original size [2020-07-17 12:04:08,405 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,405 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:169, output treesize:83 [2020-07-17 12:04:08,458 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 5=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_51|]} [2020-07-17 12:04:08,464 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 38 [2020-07-17 12:04:08,465 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,509 INFO L624 ElimStorePlain]: treesize reduction 16, result has 91.8 percent of original size [2020-07-17 12:04:08,548 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,549 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 167 [2020-07-17 12:04:08,551 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 12:04:08,552 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,553 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,554 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,555 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 12:04:08,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 12:04:08,559 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,560 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,561 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 12:04:08,562 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 12:04:08,563 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,566 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 12:04:08,567 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,568 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,569 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,569 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 12:04:08,570 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,571 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 12:04:08,573 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,574 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,575 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-17 12:04:08,575 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-17 12:04:08,577 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-17 12:04:08,578 INFO L544 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 12:04:08,636 INFO L624 ElimStorePlain]: treesize reduction 88, result has 46.7 percent of original size [2020-07-17 12:04:08,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-17 12:04:08,677 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,677 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 70 [2020-07-17 12:04:08,678 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,695 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,695 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,696 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:206, output treesize:60 [2020-07-17 12:04:08,796 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,797 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 40 [2020-07-17 12:04:08,797 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 12:04:08,798 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 12:04:08,799 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-17 12:04:08,831 INFO L624 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2020-07-17 12:04:08,836 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-07-17 12:04:08,837 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,851 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,852 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-17 12:04:08,852 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:29 [2020-07-17 12:04:08,912 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 12:04:08,913 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2020-07-17 12:04:08,914 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 12:04:08,914 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,929 INFO L624 ElimStorePlain]: treesize reduction 4, result has 80.0 percent of original size [2020-07-17 12:04:08,930 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 12:04:08,930 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:3 [2020-07-17 12:04:08,936 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 12:04:08,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 12:04:08,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2020-07-17 12:04:08,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351594409] [2020-07-17 12:04:08,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-17 12:04:08,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 12:04:08,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-17 12:04:08,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=324, Unknown=0, NotChecked=0, Total=380 [2020-07-17 12:04:08,938 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 20 states. [2020-07-17 12:04:09,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 12:04:09,969 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2020-07-17 12:04:09,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-17 12:04:09,970 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 41 [2020-07-17 12:04:09,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 12:04:09,971 INFO L225 Difference]: With dead ends: 122 [2020-07-17 12:04:09,972 INFO L226 Difference]: Without dead ends: 116 [2020-07-17 12:04:09,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2020-07-17 12:04:09,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-17 12:04:09,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2020-07-17 12:04:09,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-17 12:04:09,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2020-07-17 12:04:09,979 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 41 [2020-07-17 12:04:09,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 12:04:09,980 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2020-07-17 12:04:09,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-17 12:04:09,980 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2020-07-17 12:04:09,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-17 12:04:09,980 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 12:04:09,981 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 12:04:10,184 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-17 12:04:10,185 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 12:04:10,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 12:04:10,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2006936899, now seen corresponding path program 1 times [2020-07-17 12:04:10,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 12:04:10,187 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678219831] [2020-07-17 12:04:10,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 12:04:10,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 12:04:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 12:04:10,261 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 12:04:10,261 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 12:04:10,261 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-17 12:04:10,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 12:04:10 BoogieIcfgContainer [2020-07-17 12:04:10,349 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 12:04:10,355 INFO L168 Benchmark]: Toolchain (without parser) took 16776.20 ms. Allocated memory was 136.8 MB in the beginning and 394.3 MB in the end (delta: 257.4 MB). Free memory was 100.8 MB in the beginning and 173.9 MB in the end (delta: -73.1 MB). Peak memory consumption was 184.4 MB. Max. memory is 7.1 GB. [2020-07-17 12:04:10,356 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 12:04:10,356 INFO L168 Benchmark]: CACSL2BoogieTranslator took 704.48 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 166.2 MB in the end (delta: -65.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-07-17 12:04:10,357 INFO L168 Benchmark]: Boogie Preprocessor took 79.94 ms. Allocated memory is still 200.8 MB. Free memory was 166.2 MB in the beginning and 162.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2020-07-17 12:04:10,357 INFO L168 Benchmark]: RCFGBuilder took 792.45 ms. Allocated memory is still 200.8 MB. Free memory was 162.8 MB in the beginning and 106.3 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. [2020-07-17 12:04:10,357 INFO L168 Benchmark]: TraceAbstraction took 15183.78 ms. Allocated memory was 200.8 MB in the beginning and 394.3 MB in the end (delta: 193.5 MB). Free memory was 105.6 MB in the beginning and 173.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 125.3 MB. Max. memory is 7.1 GB. [2020-07-17 12:04:10,360 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 704.48 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 100.4 MB in the beginning and 166.2 MB in the end (delta: -65.8 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 79.94 ms. Allocated memory is still 200.8 MB. Free memory was 166.2 MB in the beginning and 162.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 792.45 ms. Allocated memory is still 200.8 MB. Free memory was 162.8 MB in the beginning and 106.3 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15183.78 ms. Allocated memory was 200.8 MB in the beginning and 394.3 MB in the end (delta: 193.5 MB). Free memory was 105.6 MB in the beginning and 173.9 MB in the end (delta: -68.2 MB). Peak memory consumption was 125.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 609]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L541] struct TreeNode* root = malloc(sizeof(*root)), *n; [L542] root->left = ((void *)0) [L543] root->right = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, root={-1:0}] [L544] COND FALSE !(__VERIFIER_nondet_int()) [L563] n = ((void *)0) [L564] struct TreeNode* pred; VAL [malloc(sizeof(*root))={-1:0}, n={0:0}, root={-1:0}] [L565] COND TRUE \read(*root) [L566] pred = ((void *)0) [L567] n = root VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={-1:0}] [L568] EXPR n->left [L568] n->left || n->right [L568] EXPR n->right [L568] n->left || n->right VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, n->left={0:0}, n->left || n->right=0, n->right={0:0}, pred={0:0}, root={-1:0}] [L568] COND FALSE !(n->left || n->right) [L575] COND FALSE !(\read(*pred)) [L581] root = ((void *)0) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L565] COND FALSE !(\read(*root)) VAL [malloc(sizeof(*root))={-1:0}, n={-1:0}, pred={0:0}, root={0:0}] [L584] List a = (List) malloc(sizeof(struct node)); VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L585] COND FALSE !(a == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, pred={0:0}, root={0:0}] [L586] List t; [L587] List p = a; VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}] [L588] COND TRUE __VERIFIER_nondet_int() [L589] p->h = 1 [L590] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L591] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-3:0}] [L592] p->n = t [L593] EXPR p->n [L593] p = p->n [L588] COND FALSE !(__VERIFIER_nondet_int()) [L595] COND TRUE __VERIFIER_nondet_int() [L596] p->h = 2 [L597] t = (List) malloc(sizeof(struct node)) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L598] COND FALSE !(t == 0) VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] [L599] p->n = t [L600] EXPR p->n [L600] p = p->n [L595] COND FALSE !(__VERIFIER_nondet_int()) [L602] p->h = 3 [L603] p = a VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, pred={0:0}, root={0:0}, t={-4:0}] [L604] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L604] COND FALSE !(p->h == 2) [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-2:0}, p->h=1, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND TRUE p->h == 1 [L607] EXPR p->n [L607] p = p->n [L606] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L606] COND FALSE !(p->h == 1) [L608] EXPR p->h VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, p->h=2, pred={0:0}, root={0:0}, t={-4:0}] [L608] COND TRUE p->h != 3 [L609] __VERIFIER_error() VAL [a={-2:0}, malloc(sizeof(*root))={-1:0}, malloc(sizeof(struct node))={-3:0}, malloc(sizeof(struct node))={-2:0}, malloc(sizeof(struct node))={-4:0}, n={-1:0}, p={-3:0}, pred={0:0}, root={0:0}, t={-4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 15.0s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 803 SDtfs, 629 SDslu, 4292 SDs, 0 SdLazy, 3646 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 300 SyntacticMatches, 6 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 151 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 759 ConstructedInterpolants, 15 QuantifiedInterpolants, 201994 SizeOfPredicates, 123 NumberOfNonLiveVariables, 1390 ConjunctsInSsa, 302 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 36/112 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...