/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-86f66a4 [2020-07-07 11:20:54,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-07 11:20:54,214 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-07 11:20:54,226 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-07 11:20:54,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-07 11:20:54,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-07 11:20:54,229 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-07 11:20:54,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-07 11:20:54,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-07 11:20:54,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-07 11:20:54,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-07 11:20:54,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-07 11:20:54,236 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-07 11:20:54,237 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-07 11:20:54,238 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-07 11:20:54,239 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-07 11:20:54,240 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-07 11:20:54,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-07 11:20:54,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-07 11:20:54,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-07 11:20:54,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-07 11:20:54,247 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-07 11:20:54,248 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-07 11:20:54,249 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-07 11:20:54,254 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-07 11:20:54,255 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-07 11:20:54,255 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-07 11:20:54,256 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-07 11:20:54,256 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-07 11:20:54,257 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-07 11:20:54,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-07 11:20:54,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-07 11:20:54,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-07 11:20:54,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-07 11:20:54,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-07 11:20:54,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-07 11:20:54,261 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-07 11:20:54,262 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-07 11:20:54,262 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-07 11:20:54,263 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-07 11:20:54,264 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-07 11:20:54,264 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-07 11:20:54,279 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-07 11:20:54,279 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-07 11:20:54,280 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-07 11:20:54,281 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-07 11:20:54,281 INFO L138 SettingsManager]: * Use SBE=true [2020-07-07 11:20:54,281 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-07 11:20:54,281 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-07 11:20:54,281 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-07 11:20:54,282 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-07 11:20:54,282 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-07 11:20:54,282 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-07 11:20:54,282 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-07 11:20:54,282 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-07 11:20:54,283 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-07 11:20:54,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-07 11:20:54,283 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-07 11:20:54,283 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-07 11:20:54,283 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-07 11:20:54,284 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-07 11:20:54,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-07 11:20:54,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-07 11:20:54,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-07 11:20:54,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-07 11:20:54,285 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-07 11:20:54,285 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-07 11:20:54,285 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-07 11:20:54,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-07 11:20:54,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-07 11:20:54,286 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-07 11:20:54,286 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-07 11:20:54,585 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-07 11:20:54,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-07 11:20:54,606 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-07 11:20:54,607 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-07 11:20:54,608 INFO L275 PluginConnector]: CDTParser initialized [2020-07-07 11:20:54,609 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-07 11:20:54,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6de4d4a/033903c2bd9b4d6eb2c1a445ca13bd6d/FLAG1a0d4085a [2020-07-07 11:20:55,201 INFO L306 CDTParser]: Found 1 translation units. [2020-07-07 11:20:55,202 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-1.i [2020-07-07 11:20:55,214 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6de4d4a/033903c2bd9b4d6eb2c1a445ca13bd6d/FLAG1a0d4085a [2020-07-07 11:20:55,519 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6de4d4a/033903c2bd9b4d6eb2c1a445ca13bd6d [2020-07-07 11:20:55,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-07 11:20:55,528 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-07 11:20:55,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-07 11:20:55,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-07 11:20:55,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-07 11:20:55,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:20:55" (1/1) ... [2020-07-07 11:20:55,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6100005b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:55, skipping insertion in model container [2020-07-07 11:20:55,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.07 11:20:55" (1/1) ... [2020-07-07 11:20:55,544 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-07 11:20:55,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-07 11:20:56,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:20:56,026 INFO L203 MainTranslator]: Completed pre-run [2020-07-07 11:20:56,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-07 11:20:56,159 INFO L208 MainTranslator]: Completed translation [2020-07-07 11:20:56,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56 WrapperNode [2020-07-07 11:20:56,160 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-07 11:20:56,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-07 11:20:56,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-07 11:20:56,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-07 11:20:56,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (1/1) ... [2020-07-07 11:20:56,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (1/1) ... [2020-07-07 11:20:56,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (1/1) ... [2020-07-07 11:20:56,194 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (1/1) ... [2020-07-07 11:20:56,233 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (1/1) ... [2020-07-07 11:20:56,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (1/1) ... [2020-07-07 11:20:56,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (1/1) ... [2020-07-07 11:20:56,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-07 11:20:56,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-07 11:20:56,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-07 11:20:56,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-07 11:20:56,258 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (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-07 11:20:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-07 11:20:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-07 11:20:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-07 11:20:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-07 11:20:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-07 11:20:56,325 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-07 11:20:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-07 11:20:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-07 11:20:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-07 11:20:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-07 11:20:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-07 11:20:56,326 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-07 11:20:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-07 11:20:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-07 11:20:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-07 11:20:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-07 11:20:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-07 11:20:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-07 11:20:56,327 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-07 11:20:56,328 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-07 11:20:56,328 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-07 11:20:56,328 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-07 11:20:56,328 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-07 11:20:56,328 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-07 11:20:56,328 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-07 11:20:56,329 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-07 11:20:56,329 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-07 11:20:56,329 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-07 11:20:56,329 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-07 11:20:56,329 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-07 11:20:56,329 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-07 11:20:56,329 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-07 11:20:56,330 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-07 11:20:56,330 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-07 11:20:56,330 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-07 11:20:56,330 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-07 11:20:56,330 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-07 11:20:56,330 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-07 11:20:56,330 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-07 11:20:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-07 11:20:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-07 11:20:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-07 11:20:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-07 11:20:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-07 11:20:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-07 11:20:56,331 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-07 11:20:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-07 11:20:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-07 11:20:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-07 11:20:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-07 11:20:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-07 11:20:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-07 11:20:56,332 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-07 11:20:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-07 11:20:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-07 11:20:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-07 11:20:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-07 11:20:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-07 11:20:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-07 11:20:56,333 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-07 11:20:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-07 11:20:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-07 11:20:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-07 11:20:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-07 11:20:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-07 11:20:56,334 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-07 11:20:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-07 11:20:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-07 11:20:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-07 11:20:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-07 11:20:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-07 11:20:56,335 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-07 11:20:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-07 11:20:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-07 11:20:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-07 11:20:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-07 11:20:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-07 11:20:56,336 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-07 11:20:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-07 11:20:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-07 11:20:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-07 11:20:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-07 11:20:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-07 11:20:56,337 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-07 11:20:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-07 11:20:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-07 11:20:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-07 11:20:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-07 11:20:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-07 11:20:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-07 11:20:56,338 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-07 11:20:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-07 11:20:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-07 11:20:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-07 11:20:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-07 11:20:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-07 11:20:56,339 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-07 11:20:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-07 11:20:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-07 11:20:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-07 11:20:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-07 11:20:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-07 11:20:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-07 11:20:56,340 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-07 11:20:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-07 11:20:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-07 11:20:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-07 11:20:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-07 11:20:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-07 11:20:56,341 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-07 11:20:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-07 11:20:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-07 11:20:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-07 11:20:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-07 11:20:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-07 11:20:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-07 11:20:56,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-07 11:20:56,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-07 11:20:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-07 11:20:56,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-07 11:20:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-07 11:20:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-07 11:20:56,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-07 11:20:56,712 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-07 11:20:57,005 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-07 11:20:57,005 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-07 11:20:57,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:20:57 BoogieIcfgContainer [2020-07-07 11:20:57,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-07 11:20:57,012 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-07 11:20:57,012 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-07 11:20:57,016 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-07 11:20:57,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.07 11:20:55" (1/3) ... [2020-07-07 11:20:57,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ce83b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:20:57, skipping insertion in model container [2020-07-07 11:20:57,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.07 11:20:56" (2/3) ... [2020-07-07 11:20:57,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ce83b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.07 11:20:57, skipping insertion in model container [2020-07-07 11:20:57,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.07 11:20:57" (3/3) ... [2020-07-07 11:20:57,021 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-1.i [2020-07-07 11:20:57,034 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-07 11:20:57,045 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-07 11:20:57,064 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-07 11:20:57,092 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-07 11:20:57,092 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-07 11:20:57,093 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-07 11:20:57,101 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-07 11:20:57,102 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-07 11:20:57,102 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-07 11:20:57,102 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-07 11:20:57,102 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-07 11:20:57,133 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2020-07-07 11:20:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-07 11:20:57,142 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:57,143 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-07 11:20:57,144 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:57,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:57,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1575706012, now seen corresponding path program 1 times [2020-07-07 11:20:57,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:57,162 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515413311] [2020-07-07 11:20:57,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:57,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:57,380 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-07 11:20:57,381 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515413311] [2020-07-07 11:20:57,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:57,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-07 11:20:57,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363836604] [2020-07-07 11:20:57,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-07 11:20:57,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:57,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-07 11:20:57,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-07 11:20:57,410 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 3 states. [2020-07-07 11:20:57,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:57,632 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2020-07-07 11:20:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-07 11:20:57,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-07 11:20:57,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:57,643 INFO L225 Difference]: With dead ends: 108 [2020-07-07 11:20:57,643 INFO L226 Difference]: Without dead ends: 47 [2020-07-07 11:20:57,647 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-07 11:20:57,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-07 11:20:57,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-07-07 11:20:57,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-07 11:20:57,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2020-07-07 11:20:57,690 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2020-07-07 11:20:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:57,690 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2020-07-07 11:20:57,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-07 11:20:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2020-07-07 11:20:57,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-07 11:20:57,692 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:57,692 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-07 11:20:57,692 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-07 11:20:57,692 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:57,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:57,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1627887593, now seen corresponding path program 1 times [2020-07-07 11:20:57,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:57,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884992932] [2020-07-07 11:20:57,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:57,781 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-07 11:20:57,782 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884992932] [2020-07-07 11:20:57,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:57,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:57,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593403930] [2020-07-07 11:20:57,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:57,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:57,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:57,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:57,785 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 4 states. [2020-07-07 11:20:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:57,968 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2020-07-07 11:20:57,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:57,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-07-07 11:20:57,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:57,972 INFO L225 Difference]: With dead ends: 75 [2020-07-07 11:20:57,972 INFO L226 Difference]: Without dead ends: 55 [2020-07-07 11:20:57,974 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-07 11:20:57,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-07 11:20:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2020-07-07 11:20:57,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-07 11:20:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2020-07-07 11:20:57,995 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2020-07-07 11:20:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:57,996 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2020-07-07 11:20:57,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2020-07-07 11:20:57,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-07 11:20:57,997 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:57,999 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-07 11:20:58,003 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-07 11:20:58,004 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:58,004 INFO L82 PathProgramCache]: Analyzing trace with hash -164754602, now seen corresponding path program 1 times [2020-07-07 11:20:58,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:58,005 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663188246] [2020-07-07 11:20:58,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:58,111 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-07 11:20:58,112 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663188246] [2020-07-07 11:20:58,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:58,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-07 11:20:58,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669151621] [2020-07-07 11:20:58,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-07 11:20:58,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:58,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-07 11:20:58,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-07 11:20:58,114 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 4 states. [2020-07-07 11:20:58,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:58,252 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2020-07-07 11:20:58,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-07 11:20:58,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2020-07-07 11:20:58,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:58,255 INFO L225 Difference]: With dead ends: 93 [2020-07-07 11:20:58,255 INFO L226 Difference]: Without dead ends: 57 [2020-07-07 11:20:58,258 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-07 11:20:58,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-07-07 11:20:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-07-07 11:20:58,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-07 11:20:58,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2020-07-07 11:20:58,272 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2020-07-07 11:20:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:58,272 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2020-07-07 11:20:58,272 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-07 11:20:58,273 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2020-07-07 11:20:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-07 11:20:58,277 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:58,278 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-07 11:20:58,278 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-07 11:20:58,283 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:58,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:58,284 INFO L82 PathProgramCache]: Analyzing trace with hash -982403052, now seen corresponding path program 1 times [2020-07-07 11:20:58,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:58,284 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723706798] [2020-07-07 11:20:58,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:58,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:58,433 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-07 11:20:58,433 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723706798] [2020-07-07 11:20:58,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:58,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:20:58,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526790896] [2020-07-07 11:20:58,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:20:58,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:58,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:20:58,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:58,435 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 6 states. [2020-07-07 11:20:58,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:58,644 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2020-07-07 11:20:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:20:58,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2020-07-07 11:20:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:58,646 INFO L225 Difference]: With dead ends: 82 [2020-07-07 11:20:58,646 INFO L226 Difference]: Without dead ends: 78 [2020-07-07 11:20:58,647 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-07 11:20:58,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-07-07 11:20:58,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2020-07-07 11:20:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-07-07 11:20:58,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2020-07-07 11:20:58,655 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2020-07-07 11:20:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:58,656 INFO L479 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2020-07-07 11:20:58,656 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:20:58,656 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2020-07-07 11:20:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 11:20:58,657 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:58,657 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-07 11:20:58,658 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-07 11:20:58,658 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:58,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:58,658 INFO L82 PathProgramCache]: Analyzing trace with hash 852152367, now seen corresponding path program 1 times [2020-07-07 11:20:58,658 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:58,659 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909475088] [2020-07-07 11:20:58,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:58,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:58,736 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-07 11:20:58,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909475088] [2020-07-07 11:20:58,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:58,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:20:58,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808902638] [2020-07-07 11:20:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:20:58,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:58,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:20:58,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:58,739 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 6 states. [2020-07-07 11:20:58,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:58,944 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-07-07 11:20:58,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:20:58,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-07 11:20:58,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:58,946 INFO L225 Difference]: With dead ends: 84 [2020-07-07 11:20:58,946 INFO L226 Difference]: Without dead ends: 76 [2020-07-07 11:20:58,947 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-07 11:20:58,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2020-07-07 11:20:58,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2020-07-07 11:20:58,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-07-07 11:20:58,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2020-07-07 11:20:58,965 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2020-07-07 11:20:58,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:58,966 INFO L479 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2020-07-07 11:20:58,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:20:58,966 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2020-07-07 11:20:58,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-07 11:20:58,967 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:58,967 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-07 11:20:58,968 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-07 11:20:58,968 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:58,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:58,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1876855343, now seen corresponding path program 1 times [2020-07-07 11:20:58,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:58,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247413152] [2020-07-07 11:20:58,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:58,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:59,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:59,027 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-07 11:20:59,028 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247413152] [2020-07-07 11:20:59,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-07 11:20:59,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-07 11:20:59,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419608981] [2020-07-07 11:20:59,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-07 11:20:59,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:59,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-07 11:20:59,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-07 11:20:59,030 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 6 states. [2020-07-07 11:20:59,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:20:59,248 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2020-07-07 11:20:59,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-07 11:20:59,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 33 [2020-07-07 11:20:59,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:20:59,249 INFO L225 Difference]: With dead ends: 84 [2020-07-07 11:20:59,250 INFO L226 Difference]: Without dead ends: 73 [2020-07-07 11:20:59,250 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-07 11:20:59,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-07 11:20:59,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2020-07-07 11:20:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-07-07 11:20:59,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2020-07-07 11:20:59,261 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2020-07-07 11:20:59,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:20:59,261 INFO L479 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2020-07-07 11:20:59,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-07 11:20:59,262 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2020-07-07 11:20:59,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-07 11:20:59,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:20:59,263 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-07 11:20:59,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-07 11:20:59,263 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:20:59,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:20:59,264 INFO L82 PathProgramCache]: Analyzing trace with hash -778946181, now seen corresponding path program 1 times [2020-07-07 11:20:59,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:20:59,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400698315] [2020-07-07 11:20:59,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:20:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:59,401 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-07 11:20:59,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400698315] [2020-07-07 11:20:59,403 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [20111012] [2020-07-07 11:20:59,403 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-07 11:20:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:20:59,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-07 11:20:59,555 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:20:59,623 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-07 11:20:59,624 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,628 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:59,628 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,628 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-07 11:20:59,662 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:59,662 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-07 11:20:59,663 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,673 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:59,681 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-07 11:20:59,682 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,691 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:59,691 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-07 11:20:59,692 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-07-07 11:20:59,714 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-07 11:20:59,714 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-07 11:20:59,715 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,719 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:59,720 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,720 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-07-07 11:20:59,754 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-07 11:20:59,755 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,761 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:59,763 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-07 11:20:59,763 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-07-07 11:20:59,796 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-07 11:20:59,797 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:20:59,802 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:20:59,802 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-07 11:20:59,803 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-07 11:20:59,807 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-07 11:20:59,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:20:59,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2020-07-07 11:20:59,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918665995] [2020-07-07 11:20:59,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 11:20:59,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:20:59,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 11:20:59,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:20:59,810 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 11 states. [2020-07-07 11:21:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:00,282 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2020-07-07 11:21:00,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:21:00,284 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-07 11:21:00,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:00,285 INFO L225 Difference]: With dead ends: 86 [2020-07-07 11:21:00,285 INFO L226 Difference]: Without dead ends: 80 [2020-07-07 11:21:00,286 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:21:00,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2020-07-07 11:21:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2020-07-07 11:21:00,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-07-07 11:21:00,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 92 transitions. [2020-07-07 11:21:00,293 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 92 transitions. Word has length 35 [2020-07-07 11:21:00,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:00,293 INFO L479 AbstractCegarLoop]: Abstraction has 68 states and 92 transitions. [2020-07-07 11:21:00,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 11:21:00,294 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 92 transitions. [2020-07-07 11:21:00,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-07 11:21:00,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:00,295 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-07 11:21:00,510 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-07 11:21:00,511 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:00,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:00,512 INFO L82 PathProgramCache]: Analyzing trace with hash 84455483, now seen corresponding path program 1 times [2020-07-07 11:21:00,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:00,513 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987575945] [2020-07-07 11:21:00,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:00,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:00,621 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-07 11:21:00,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987575945] [2020-07-07 11:21:00,621 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796275136] [2020-07-07 11:21:00,622 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-07 11:21:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:00,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 28 conjunts are in the unsatisfiable core [2020-07-07 11:21:00,736 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:21:00,750 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-07 11:21:00,750 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,752 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:00,752 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,753 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-07 11:21:00,769 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:00,770 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-07 11:21:00,770 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,778 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:00,782 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-07 11:21:00,783 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,790 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:00,791 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-07 11:21:00,791 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2020-07-07 11:21:00,812 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-07 11:21:00,812 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-07 11:21:00,813 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,817 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:00,818 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,818 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2020-07-07 11:21:00,839 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-07 11:21:00,840 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,845 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:00,847 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-07 11:21:00,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-07-07 11:21:00,879 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-07 11:21:00,880 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:00,884 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:00,885 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-07 11:21:00,886 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-07-07 11:21:00,889 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-07 11:21:00,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:21:00,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2020-07-07 11:21:00,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166807081] [2020-07-07 11:21:00,890 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-07 11:21:00,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:21:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-07 11:21:00,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-07 11:21:00,891 INFO L87 Difference]: Start difference. First operand 68 states and 92 transitions. Second operand 11 states. [2020-07-07 11:21:01,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:01,296 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2020-07-07 11:21:01,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:21:01,297 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2020-07-07 11:21:01,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:01,299 INFO L225 Difference]: With dead ends: 95 [2020-07-07 11:21:01,299 INFO L226 Difference]: Without dead ends: 91 [2020-07-07 11:21:01,300 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:21:01,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-07 11:21:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 79. [2020-07-07 11:21:01,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-07 11:21:01,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 106 transitions. [2020-07-07 11:21:01,311 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 106 transitions. Word has length 35 [2020-07-07 11:21:01,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:01,312 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 106 transitions. [2020-07-07 11:21:01,312 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-07 11:21:01,312 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 106 transitions. [2020-07-07 11:21:01,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-07 11:21:01,313 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:01,313 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-07 11:21:01,517 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:21:01,518 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:01,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:01,519 INFO L82 PathProgramCache]: Analyzing trace with hash -169587242, now seen corresponding path program 1 times [2020-07-07 11:21:01,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:01,519 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111631206] [2020-07-07 11:21:01,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:01,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:21:01,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111631206] [2020-07-07 11:21:01,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2109217530] [2020-07-07 11:21:01,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:21:01,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:01,892 INFO L264 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 35 conjunts are in the unsatisfiable core [2020-07-07 11:21:01,895 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:21:01,903 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-07 11:21:01,904 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:01,905 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:01,906 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:01,906 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-07 11:21:01,952 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:01,953 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-07 11:21:01,954 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:01,959 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:01,959 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:01,959 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-07-07 11:21:01,990 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-07 11:21:01,991 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,002 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,012 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-07 11:21:02,012 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,021 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,022 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-07 11:21:02,023 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-07-07 11:21:02,054 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_42|], 2=[|v_#memory_$Pointer$.base_45|, |v_#memory_$Pointer$.offset_43|]} [2020-07-07 11:21:02,059 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-07 11:21:02,060 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,082 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,104 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,105 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-07 11:21:02,110 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-07 11:21:02,111 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:21:02,112 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,128 INFO L624 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-07-07 11:21:02,133 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-07 11:21:02,134 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,141 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,141 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,141 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-07-07 11:21:02,174 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-07 11:21:02,175 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,181 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,184 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-07 11:21:02,185 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,189 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,190 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-07 11:21:02,190 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-07-07 11:21:02,196 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-07 11:21:02,196 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:02,198 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:02,198 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-07 11:21:02,198 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-07 11:21:02,201 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-07 11:21:02,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:21:02,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 16 [2020-07-07 11:21:02,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623468424] [2020-07-07 11:21:02,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-07 11:21:02,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:21:02,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-07 11:21:02,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2020-07-07 11:21:02,203 INFO L87 Difference]: Start difference. First operand 79 states and 106 transitions. Second operand 16 states. [2020-07-07 11:21:02,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:02,876 INFO L93 Difference]: Finished difference Result 99 states and 128 transitions. [2020-07-07 11:21:02,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:21:02,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 37 [2020-07-07 11:21:02,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:02,880 INFO L225 Difference]: With dead ends: 99 [2020-07-07 11:21:02,880 INFO L226 Difference]: Without dead ends: 95 [2020-07-07 11:21:02,880 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2020-07-07 11:21:02,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-07-07 11:21:02,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 83. [2020-07-07 11:21:02,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2020-07-07 11:21:02,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 111 transitions. [2020-07-07 11:21:02,893 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 111 transitions. Word has length 37 [2020-07-07 11:21:02,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:02,893 INFO L479 AbstractCegarLoop]: Abstraction has 83 states and 111 transitions. [2020-07-07 11:21:02,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-07 11:21:02,894 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 111 transitions. [2020-07-07 11:21:02,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-07 11:21:02,895 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:02,895 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-07 11:21:03,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:21:03,097 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:03,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:03,098 INFO L82 PathProgramCache]: Analyzing trace with hash 284097905, now seen corresponding path program 1 times [2020-07-07 11:21:03,098 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:03,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684490334] [2020-07-07 11:21:03,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:03,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:21:03,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684490334] [2020-07-07 11:21:03,325 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [434739576] [2020-07-07 11:21:03,325 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-07 11:21:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:03,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 34 conjunts are in the unsatisfiable core [2020-07-07 11:21:03,467 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:21:03,479 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-07 11:21:03,480 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,482 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,482 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,482 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-07 11:21:03,535 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,535 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-07 11:21:03,536 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,544 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,545 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,545 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2020-07-07 11:21:03,581 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-07 11:21:03,581 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,596 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,601 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-07 11:21:03,601 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,616 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,617 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-07 11:21:03,617 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2020-07-07 11:21:03,646 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_45|]} [2020-07-07 11:21:03,652 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-07 11:21:03,652 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,667 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,692 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,692 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-07 11:21:03,694 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-07 11:21:03,694 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:21:03,695 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,716 INFO L624 ElimStorePlain]: treesize reduction 48, result has 61.0 percent of original size [2020-07-07 11:21:03,720 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-07 11:21:03,721 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,730 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,730 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,731 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2020-07-07 11:21:03,771 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-07 11:21:03,772 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,779 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,784 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-07 11:21:03,784 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,789 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,790 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-07 11:21:03,790 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:48, output treesize:7 [2020-07-07 11:21:03,797 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-07 11:21:03,798 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:03,800 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:03,801 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-07 11:21:03,801 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-07 11:21:03,824 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-07 11:21:03,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:21:03,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 17 [2020-07-07 11:21:03,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193677514] [2020-07-07 11:21:03,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-07 11:21:03,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:21:03,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-07 11:21:03,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2020-07-07 11:21:03,826 INFO L87 Difference]: Start difference. First operand 83 states and 111 transitions. Second operand 17 states. [2020-07-07 11:21:04,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:04,482 INFO L93 Difference]: Finished difference Result 101 states and 130 transitions. [2020-07-07 11:21:04,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:21:04,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 39 [2020-07-07 11:21:04,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:04,483 INFO L225 Difference]: With dead ends: 101 [2020-07-07 11:21:04,484 INFO L226 Difference]: Without dead ends: 91 [2020-07-07 11:21:04,485 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2020-07-07 11:21:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-07-07 11:21:04,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 74. [2020-07-07 11:21:04,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-07-07 11:21:04,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2020-07-07 11:21:04,493 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 39 [2020-07-07 11:21:04,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:04,493 INFO L479 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2020-07-07 11:21:04,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-07 11:21:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2020-07-07 11:21:04,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-07 11:21:04,494 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:04,494 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-07 11:21:04,700 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:21:04,701 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:04,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:04,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1308800881, now seen corresponding path program 2 times [2020-07-07 11:21:04,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:04,702 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569507754] [2020-07-07 11:21:04,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:04,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:04,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:04,920 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:21:04,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569507754] [2020-07-07 11:21:04,921 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381525367] [2020-07-07 11:21:04,921 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-07 11:21:05,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 11:21:05,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:21:05,031 INFO L264 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 36 conjunts are in the unsatisfiable core [2020-07-07 11:21:05,034 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:21:05,039 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-07 11:21:05,040 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,044 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,044 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,044 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-07 11:21:05,060 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,060 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-07 11:21:05,061 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,072 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,072 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,073 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2020-07-07 11:21:05,082 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-07 11:21:05,083 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,097 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,105 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-07 11:21:05,106 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,119 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,120 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-07 11:21:05,120 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:26 [2020-07-07 11:21:05,132 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_44|], 2=[|v_#memory_$Pointer$.base_49|, |v_#memory_$Pointer$.offset_47|]} [2020-07-07 11:21:05,137 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-07 11:21:05,137 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,149 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,171 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,172 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-07 11:21:05,173 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 3, 2, 1] term [2020-07-07 11:21:05,173 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-07 11:21:05,174 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,192 INFO L624 ElimStorePlain]: treesize reduction 36, result has 63.3 percent of original size [2020-07-07 11:21:05,196 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-07 11:21:05,196 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,203 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,203 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,203 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:105, output treesize:27 [2020-07-07 11:21:05,237 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-07 11:21:05,238 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,245 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,253 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-07 11:21:05,254 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,259 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,259 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-07 11:21:05,260 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:7 [2020-07-07 11:21:05,268 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-07 11:21:05,269 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:05,270 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:05,271 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-07 11:21:05,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-07 11:21:05,297 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-07 11:21:05,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:21:05,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 13 [2020-07-07 11:21:05,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128038969] [2020-07-07 11:21:05,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-07 11:21:05,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:21:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-07 11:21:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2020-07-07 11:21:05,302 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand 13 states. [2020-07-07 11:21:05,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:05,789 INFO L93 Difference]: Finished difference Result 94 states and 121 transitions. [2020-07-07 11:21:05,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-07 11:21:05,790 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 39 [2020-07-07 11:21:05,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:05,791 INFO L225 Difference]: With dead ends: 94 [2020-07-07 11:21:05,791 INFO L226 Difference]: Without dead ends: 81 [2020-07-07 11:21:05,792 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=302, Unknown=0, NotChecked=0, Total=380 [2020-07-07 11:21:05,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2020-07-07 11:21:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 69. [2020-07-07 11:21:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-07 11:21:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2020-07-07 11:21:05,797 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 39 [2020-07-07 11:21:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:05,797 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2020-07-07 11:21:05,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-07 11:21:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2020-07-07 11:21:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-07 11:21:05,798 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:05,798 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-07 11:21:06,010 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-07 11:21:06,011 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash -315248798, now seen corresponding path program 2 times [2020-07-07 11:21:06,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:06,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010715651] [2020-07-07 11:21:06,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:06,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:06,183 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-07 11:21:06,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010715651] [2020-07-07 11:21:06,183 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364692236] [2020-07-07 11:21:06,184 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-07 11:21:06,314 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-07 11:21:06,314 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:21:06,316 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 40 conjunts are in the unsatisfiable core [2020-07-07 11:21:06,318 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:21:06,340 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-07 11:21:06,340 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,346 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,346 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,346 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-07 11:21:06,373 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,374 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-07 11:21:06,375 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,411 INFO L624 ElimStorePlain]: treesize reduction 14, result has 71.4 percent of original size [2020-07-07 11:21:06,416 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-07 11:21:06,416 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,449 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,449 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-07 11:21:06,449 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:31 [2020-07-07 11:21:06,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:21:06,490 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-07 11:21:06,491 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,510 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,511 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,511 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:44, output treesize:25 [2020-07-07 11:21:06,554 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,555 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-07 11:21:06,556 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,566 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,569 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-07 11:21:06,570 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,580 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,581 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-07 11:21:06,581 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:30 [2020-07-07 11:21:06,623 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-07 11:21:06,623 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-07 11:21:06,649 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-07 11:21:06,650 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-07 11:21:06,650 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,660 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,662 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-07 11:21:06,662 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:30 [2020-07-07 11:21:06,713 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-07 11:21:06,716 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,728 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,730 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-07 11:21:06,730 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:41, output treesize:37 [2020-07-07 11:21:06,781 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-07 11:21:06,781 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:06,788 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:06,788 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-07 11:21:06,789 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:41, output treesize:3 [2020-07-07 11:21:06,812 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-07 11:21:06,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:21:06,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 19 [2020-07-07 11:21:06,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039735759] [2020-07-07 11:21:06,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-07-07 11:21:06,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:21:06,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-07-07 11:21:06,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2020-07-07 11:21:06,815 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand 19 states. [2020-07-07 11:21:07,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:07,559 INFO L93 Difference]: Finished difference Result 113 states and 144 transitions. [2020-07-07 11:21:07,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 11:21:07,560 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 39 [2020-07-07 11:21:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:07,563 INFO L225 Difference]: With dead ends: 113 [2020-07-07 11:21:07,563 INFO L226 Difference]: Without dead ends: 105 [2020-07-07 11:21:07,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=745, Unknown=0, NotChecked=0, Total=930 [2020-07-07 11:21:07,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2020-07-07 11:21:07,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2020-07-07 11:21:07,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-07-07 11:21:07,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2020-07-07 11:21:07,570 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 114 transitions. Word has length 39 [2020-07-07 11:21:07,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:07,570 INFO L479 AbstractCegarLoop]: Abstraction has 87 states and 114 transitions. [2020-07-07 11:21:07,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-07-07 11:21:07,571 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2020-07-07 11:21:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-07 11:21:07,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:07,572 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-07 11:21:07,785 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:21:07,786 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:07,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:07,787 INFO L82 PathProgramCache]: Analyzing trace with hash -15546846, now seen corresponding path program 1 times [2020-07-07 11:21:07,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:07,787 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220758817] [2020-07-07 11:21:07,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:07,956 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-07 11:21:07,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220758817] [2020-07-07 11:21:07,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673276143] [2020-07-07 11:21:07,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-07 11:21:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:08,063 INFO L264 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 38 conjunts are in the unsatisfiable core [2020-07-07 11:21:08,065 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:21:08,078 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-07 11:21:08,078 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,081 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,082 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,082 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-07-07 11:21:08,149 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,150 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-07 11:21:08,150 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,176 INFO L624 ElimStorePlain]: treesize reduction 14, result has 69.6 percent of original size [2020-07-07 11:21:08,204 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-07 11:21:08,205 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,220 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,221 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-07 11:21:08,221 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2020-07-07 11:21:08,263 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-07 11:21:08,264 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-07 11:21:08,264 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,271 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,271 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,271 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:22 [2020-07-07 11:21:08,316 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,316 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-07 11:21:08,317 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,326 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,329 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-07 11:21:08,330 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,338 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,339 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-07 11:21:08,339 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:27 [2020-07-07 11:21:08,373 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 1] term [2020-07-07 11:21:08,374 INFO L501 QuantifierPusher]: Distributing 1 conjuncts over 3 disjuncts [2020-07-07 11:21:08,389 INFO L350 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2020-07-07 11:21:08,389 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-07 11:21:08,390 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,399 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,400 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-07 11:21:08,401 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:27 [2020-07-07 11:21:08,457 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-07 11:21:08,457 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,468 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,470 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-07 11:21:08,471 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-07-07 11:21:08,529 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-07 11:21:08,530 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:08,542 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:08,542 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-07 11:21:08,543 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-07-07 11:21:08,565 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-07 11:21:08,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:21:08,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 21 [2020-07-07 11:21:08,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19213031] [2020-07-07 11:21:08,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-07 11:21:08,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:21:08,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-07 11:21:08,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-07-07 11:21:08,568 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand 21 states. [2020-07-07 11:21:09,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:09,642 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2020-07-07 11:21:09,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-07 11:21:09,642 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 39 [2020-07-07 11:21:09,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:09,644 INFO L225 Difference]: With dead ends: 135 [2020-07-07 11:21:09,644 INFO L226 Difference]: Without dead ends: 129 [2020-07-07 11:21:09,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=222, Invalid=968, Unknown=0, NotChecked=0, Total=1190 [2020-07-07 11:21:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2020-07-07 11:21:09,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 95. [2020-07-07 11:21:09,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2020-07-07 11:21:09,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 124 transitions. [2020-07-07 11:21:09,651 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 124 transitions. Word has length 39 [2020-07-07 11:21:09,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:09,651 INFO L479 AbstractCegarLoop]: Abstraction has 95 states and 124 transitions. [2020-07-07 11:21:09,652 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-07 11:21:09,652 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 124 transitions. [2020-07-07 11:21:09,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-07 11:21:09,652 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:09,653 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-07 11:21:09,866 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-07 11:21:09,867 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:09,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:09,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1233000963, now seen corresponding path program 3 times [2020-07-07 11:21:09,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:09,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114095089] [2020-07-07 11:21:09,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:10,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-07 11:21:10,263 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-07 11:21:10,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114095089] [2020-07-07 11:21:10,264 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [710090457] [2020-07-07 11:21:10,264 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-07 11:21:10,500 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-07 11:21:10,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-07 11:21:10,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 61 conjunts are in the unsatisfiable core [2020-07-07 11:21:10,515 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-07 11:21:10,524 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-07 11:21:10,524 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,528 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,529 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,529 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-07 11:21:10,560 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,561 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-07 11:21:10,561 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,600 INFO L624 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2020-07-07 11:21:10,600 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,600 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2020-07-07 11:21:10,639 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-07 11:21:10,640 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,654 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,659 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-07 11:21:10,660 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,674 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,675 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-07 11:21:10,675 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:40 [2020-07-07 11:21:10,727 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,727 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-07 11:21:10,728 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,753 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,754 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_int_55|], 2=[|v_#memory_$Pointer$.base_56|, |v_#memory_$Pointer$.offset_49|]} [2020-07-07 11:21:10,758 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-07 11:21:10,759 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,784 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,816 INFO L350 Elim1Store]: treesize reduction 21, result has 41.7 percent of original size [2020-07-07 11:21:10,816 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 39 treesize of output 27 [2020-07-07 11:21:10,817 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,856 INFO L624 ElimStorePlain]: treesize reduction 8, result has 87.3 percent of original size [2020-07-07 11:21:10,861 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 23 treesize of output 11 [2020-07-07 11:21:10,862 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:10,876 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,877 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-07 11:21:10,877 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:89, output treesize:40 [2020-07-07 11:21:10,944 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:10,945 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 149 [2020-07-07 11:21:10,946 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 3, 2, 1] term [2020-07-07 11:21:10,946 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-07 11:21:10,947 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,004 INFO L624 ElimStorePlain]: treesize reduction 26, result has 85.6 percent of original size [2020-07-07 11:21:11,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-07 11:21:11,011 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 55 treesize of output 19 [2020-07-07 11:21:11,012 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,033 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,037 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 74 [2020-07-07 11:21:11,038 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,057 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,058 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-07 11:21:11,059 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:162, output treesize:118 [2020-07-07 11:21:11,108 INFO L440 ElimStorePlain]: Different costs {2=[|v_#memory_int_57|], 6=[|v_#memory_$Pointer$.base_58|, |v_#memory_$Pointer$.offset_51|]} [2020-07-07 11:21:11,115 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 69 treesize of output 54 [2020-07-07 11:21:11,116 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,138 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,189 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,190 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 286 treesize of output 261 [2020-07-07 11:21:11,192 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 3, 2, 1] term [2020-07-07 11:21:11,193 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-07 11:21:11,193 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-07 11:21:11,196 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,247 INFO L624 ElimStorePlain]: treesize reduction 212, result has 49.0 percent of original size [2020-07-07 11:21:11,284 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,284 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 193 treesize of output 212 [2020-07-07 11:21:11,287 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,329 INFO L624 ElimStorePlain]: treesize reduction 100, result has 51.2 percent of original size [2020-07-07 11:21:11,330 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,330 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:307, output treesize:105 [2020-07-07 11:21:11,459 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,460 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 109 treesize of output 68 [2020-07-07 11:21:11,461 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-07 11:21:11,462 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-07 11:21:11,463 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-07 11:21:11,497 INFO L624 ElimStorePlain]: treesize reduction 22, result has 71.1 percent of original size [2020-07-07 11:21:11,500 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2020-07-07 11:21:11,500 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,507 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,508 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-07 11:21:11,509 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:123, output treesize:30 [2020-07-07 11:21:11,554 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,555 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 21 [2020-07-07 11:21:11,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-07 11:21:11,556 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-07 11:21:11,567 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-07 11:21:11,568 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-07 11:21:11,568 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:3 [2020-07-07 11:21:11,574 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-07 11:21:11,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-07 11:21:11,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2020-07-07 11:21:11,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716355322] [2020-07-07 11:21:11,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-07 11:21:11,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-07 11:21:11,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-07 11:21:11,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2020-07-07 11:21:11,575 INFO L87 Difference]: Start difference. First operand 95 states and 124 transitions. Second operand 21 states. [2020-07-07 11:21:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-07 11:21:12,591 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2020-07-07 11:21:12,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-07 11:21:12,591 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-07-07 11:21:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-07 11:21:12,593 INFO L225 Difference]: With dead ends: 122 [2020-07-07 11:21:12,593 INFO L226 Difference]: Without dead ends: 116 [2020-07-07 11:21:12,594 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=176, Invalid=946, Unknown=0, NotChecked=0, Total=1122 [2020-07-07 11:21:12,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2020-07-07 11:21:12,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 100. [2020-07-07 11:21:12,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-07 11:21:12,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 130 transitions. [2020-07-07 11:21:12,600 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 130 transitions. Word has length 41 [2020-07-07 11:21:12,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-07 11:21:12,601 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 130 transitions. [2020-07-07 11:21:12,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-07 11:21:12,601 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 130 transitions. [2020-07-07 11:21:12,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-07 11:21:12,601 INFO L414 BasicCegarLoop]: Found error trace [2020-07-07 11:21:12,602 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-07 11:21:12,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2020-07-07 11:21:12,807 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-07 11:21:12,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-07 11:21:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2006936899, now seen corresponding path program 1 times [2020-07-07 11:21:12,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-07 11:21:12,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513846357] [2020-07-07 11:21:12,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-07 11:21:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:21:12,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-07 11:21:12,890 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-07 11:21:12,890 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-07 11:21:12,891 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-07 11:21:12,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.07 11:21:12 BoogieIcfgContainer [2020-07-07 11:21:12,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-07 11:21:12,941 INFO L168 Benchmark]: Toolchain (without parser) took 17413.38 ms. Allocated memory was 141.6 MB in the beginning and 422.6 MB in the end (delta: 281.0 MB). Free memory was 97.7 MB in the beginning and 333.3 MB in the end (delta: -235.6 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:12,942 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 141.6 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-07 11:21:12,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 631.18 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 97.5 MB in the beginning and 164.4 MB in the end (delta: -66.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:12,943 INFO L168 Benchmark]: Boogie Preprocessor took 95.65 ms. Allocated memory is still 199.2 MB. Free memory was 164.4 MB in the beginning and 161.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:12,943 INFO L168 Benchmark]: RCFGBuilder took 753.96 ms. Allocated memory is still 199.2 MB. Free memory was 160.9 MB in the beginning and 104.2 MB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. [2020-07-07 11:21:12,943 INFO L168 Benchmark]: TraceAbstraction took 15928.06 ms. Allocated memory was 199.2 MB in the beginning and 422.6 MB in the end (delta: 223.3 MB). Free memory was 104.2 MB in the beginning and 333.3 MB in the end (delta: -229.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-07 11:21:12,945 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.53 ms. Allocated memory is still 141.6 MB. Free memory was 117.8 MB in the beginning and 117.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 631.18 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 97.5 MB in the beginning and 164.4 MB in the end (delta: -66.9 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 95.65 ms. Allocated memory is still 199.2 MB. Free memory was 164.4 MB in the beginning and 161.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 753.96 ms. Allocated memory is still 199.2 MB. Free memory was 160.9 MB in the beginning and 104.2 MB in the end (delta: 56.6 MB). Peak memory consumption was 56.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15928.06 ms. Allocated memory was 199.2 MB in the beginning and 422.6 MB in the end (delta: 223.3 MB). Free memory was 104.2 MB in the beginning and 333.3 MB in the end (delta: -229.1 MB). There was no memory consumed. 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.8s, OverallIterations: 15, TraceHistogramMax: 3, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 791 SDtfs, 954 SDslu, 3708 SDs, 0 SdLazy, 3465 SolverSat, 349 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 512 GetRequests, 298 SyntacticMatches, 6 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 4.2s 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, 169 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 822 NumberOfCodeBlocks, 822 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 759 ConstructedInterpolants, 15 QuantifiedInterpolants, 215106 SizeOfPredicates, 122 NumberOfNonLiveVariables, 1390 ConjunctsInSsa, 300 ConjunctsInUnsatCore, 22 InterpolantComputations, 6 PerfectInterpolantSequences, 32/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...