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-simple/dll2c_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:02:11,499 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:02:11,502 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:02:11,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:02:11,514 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:02:11,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:02:11,517 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:02:11,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:02:11,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:02:11,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:02:11,522 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:02:11,523 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:02:11,523 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:02:11,524 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:02:11,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:02:11,527 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:02:11,528 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:02:11,528 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:02:11,530 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:02:11,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:02:11,533 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:02:11,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:02:11,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:02:11,536 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:02:11,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:02:11,539 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:02:11,539 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:02:11,540 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:02:11,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:02:11,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:02:11,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:02:11,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:02:11,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:02:11,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:02:11,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:02:11,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:02:11,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:02:11,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:02:11,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:02:11,547 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:02:11,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:02:11,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-20 13:02:11,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:02:11,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:02:11,565 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:02:11,565 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:02:11,565 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:02:11,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:02:11,566 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:02:11,566 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:02:11,566 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:02:11,566 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:02:11,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:02:11,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:02:11,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:02:11,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:02:11,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:02:11,567 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:02:11,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:02:11,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:02:11,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:02:11,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:02:11,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:02:11,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:02:11,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:02:11,569 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:02:11,569 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:02:11,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:02:11,570 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:02:11,570 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:02:11,570 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:02:11,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:02:11,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:02:11,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:02:11,642 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:02:11,642 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:02:11,643 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2019-09-20 13:02:11,712 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964776c71/9cdf0286b8404086a5cde4353e5a2f0d/FLAGa123f2841 [2019-09-20 13:02:12,271 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:02:12,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2019-09-20 13:02:12,286 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964776c71/9cdf0286b8404086a5cde4353e5a2f0d/FLAGa123f2841 [2019-09-20 13:02:12,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964776c71/9cdf0286b8404086a5cde4353e5a2f0d [2019-09-20 13:02:12,578 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:02:12,580 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:02:12,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:12,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:02:12,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:02:12,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:12" (1/1) ... [2019-09-20 13:02:12,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fc7feb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:12, skipping insertion in model container [2019-09-20 13:02:12,590 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:02:12" (1/1) ... [2019-09-20 13:02:12,598 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:02:12,662 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:02:13,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:13,208 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:02:13,271 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:02:13,334 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:02:13,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13 WrapperNode [2019-09-20 13:02:13,335 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:02:13,336 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:02:13,336 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:02:13,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:02:13,350 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... [2019-09-20 13:02:13,350 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... [2019-09-20 13:02:13,371 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... [2019-09-20 13:02:13,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... [2019-09-20 13:02:13,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... [2019-09-20 13:02:13,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... [2019-09-20 13:02:13,401 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... [2019-09-20 13:02:13,408 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:02:13,409 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:02:13,409 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:02:13,409 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:02:13,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:02:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:02:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:02:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:02:13,477 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:02:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-20 13:02:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-09-20 13:02:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-09-20 13:02:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-09-20 13:02:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-09-20 13:02:13,478 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-09-20 13:02:13,479 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:02:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:02:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:02:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:02:13,479 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:02:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:02:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:02:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:02:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:02:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:02:13,480 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:02:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:02:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:02:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:02:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:02:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:02:13,481 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:02:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:02:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:02:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:02:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:02:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:02:13,482 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:02:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:02:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:02:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:02:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:02:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:02:13,483 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:02:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:02:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:02:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:02:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:02:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:02:13,484 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:02:13,485 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:02:13,485 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:02:13,485 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:02:13,485 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:02:13,485 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:02:13,485 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:02:13,486 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:02:13,486 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:02:13,486 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:02:13,486 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:02:13,486 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:02:13,486 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:02:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:02:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:02:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:02:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:02:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:02:13,487 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:02:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:02:13,488 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:02:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:02:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:02:13,489 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:02:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:02:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:02:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:02:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:02:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:02:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:02:13,490 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:02:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:02:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:02:13,491 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:02:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:02:13,492 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:02:13,493 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:02:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:02:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:02:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:02:13,494 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:02:13,495 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:02:13,496 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:02:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:02:13,497 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:02:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:02:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:02:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:02:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:02:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:02:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:02:13,498 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:02:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:02:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:02:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:02:13,499 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:02:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:02:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:02:13,500 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:02:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:02:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:02:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:02:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:02:13,501 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-20 13:02:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-09-20 13:02:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:02:13,502 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:02:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:02:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-09-20 13:02:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-09-20 13:02:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:02:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:02:13,503 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-09-20 13:02:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:02:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-09-20 13:02:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:02:13,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:02:13,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:02:14,028 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-20 13:02:14,145 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:02:14,145 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-20 13:02:14,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:14 BoogieIcfgContainer [2019-09-20 13:02:14,147 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:02:14,148 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:02:14,148 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:02:14,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:02:14,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:02:12" (1/3) ... [2019-09-20 13:02:14,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49058628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:14, skipping insertion in model container [2019-09-20 13:02:14,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:02:13" (2/3) ... [2019-09-20 13:02:14,153 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49058628 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:02:14, skipping insertion in model container [2019-09-20 13:02:14,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:02:14" (3/3) ... [2019-09-20 13:02:14,155 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2019-09-20 13:02:14,163 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:02:14,172 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:02:14,189 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:02:14,219 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:02:14,219 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:02:14,220 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:02:14,220 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:02:14,220 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:02:14,220 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:02:14,221 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:02:14,221 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:02:14,221 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:02:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-09-20 13:02:14,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:02:14,250 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:14,252 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:14,254 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:14,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:14,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-09-20 13:02:14,263 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:14,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:14,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:14,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:14,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:14,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:14,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-20 13:02:14,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:02:14,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:02:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:14,487 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2019-09-20 13:02:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:14,517 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2019-09-20 13:02:14,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:02:14,519 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-20 13:02:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:14,529 INFO L225 Difference]: With dead ends: 97 [2019-09-20 13:02:14,530 INFO L226 Difference]: Without dead ends: 45 [2019-09-20 13:02:14,534 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:02:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-20 13:02:14,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-20 13:02:14,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-20 13:02:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-09-20 13:02:14,584 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-09-20 13:02:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:14,586 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-09-20 13:02:14,586 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:02:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-09-20 13:02:14,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:02:14,589 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:14,589 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:14,590 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:14,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-09-20 13:02:14,591 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:14,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:14,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:14,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:14,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:14,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:02:14,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:02:14,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:02:14,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:02:14,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:02:14,746 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2019-09-20 13:02:14,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:14,831 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-09-20 13:02:14,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:02:14,832 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-09-20 13:02:14,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:14,834 INFO L225 Difference]: With dead ends: 68 [2019-09-20 13:02:14,834 INFO L226 Difference]: Without dead ends: 55 [2019-09-20 13:02:14,835 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-20 13:02:14,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-09-20 13:02:14,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:02:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-09-20 13:02:14,850 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-09-20 13:02:14,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:14,851 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-09-20 13:02:14,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:02:14,851 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-09-20 13:02:14,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:02:14,855 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:14,855 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:14,856 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:14,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:14,857 INFO L82 PathProgramCache]: Analyzing trace with hash 2064355028, now seen corresponding path program 1 times [2019-09-20 13:02:14,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:14,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:14,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:15,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:15,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:15,167 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:15,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:15,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 13:02:15,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:15,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:02:15,389 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:02:15,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 13 [2019-09-20 13:02:15,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-20 13:02:15,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-20 13:02:15,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-20 13:02:15,391 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 13 states. [2019-09-20 13:02:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:15,668 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-20 13:02:15,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:02:15,668 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-20 13:02:15,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:15,672 INFO L225 Difference]: With dead ends: 85 [2019-09-20 13:02:15,672 INFO L226 Difference]: Without dead ends: 59 [2019-09-20 13:02:15,673 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-09-20 13:02:15,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-20 13:02:15,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-09-20 13:02:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-20 13:02:15,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-09-20 13:02:15,682 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2019-09-20 13:02:15,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:15,682 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-09-20 13:02:15,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-20 13:02:15,683 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-09-20 13:02:15,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:02:15,684 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:15,684 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:15,685 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:15,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:15,685 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-09-20 13:02:15,685 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:15,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:15,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:15,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:15,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:15,858 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-20 13:02:15,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:15,859 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:15,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:16,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-20 13:02:16,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:16,067 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-20 13:02:16,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:02:16,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-09-20 13:02:16,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:02:16,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:02:16,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:02:16,075 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 11 states. [2019-09-20 13:02:16,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:16,269 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-09-20 13:02:16,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:02:16,270 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-20 13:02:16,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:16,272 INFO L225 Difference]: With dead ends: 85 [2019-09-20 13:02:16,272 INFO L226 Difference]: Without dead ends: 64 [2019-09-20 13:02:16,273 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:02:16,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-20 13:02:16,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2019-09-20 13:02:16,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-20 13:02:16,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-09-20 13:02:16,285 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 50 [2019-09-20 13:02:16,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:16,286 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-09-20 13:02:16,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:02:16,286 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-09-20 13:02:16,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-20 13:02:16,288 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:16,288 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:16,289 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:16,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:16,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1662053774, now seen corresponding path program 1 times [2019-09-20 13:02:16,289 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:16,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:16,394 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:02:16,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:16,395 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:16,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:16,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-20 13:02:16,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:16,558 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-20 13:02:16,564 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:02:16,564 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-20 13:02:16,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:02:16,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:02:16,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:02:16,566 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 5 states. [2019-09-20 13:02:16,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:02:16,650 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-20 13:02:16,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:02:16,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-20 13:02:16,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:02:16,652 INFO L225 Difference]: With dead ends: 85 [2019-09-20 13:02:16,652 INFO L226 Difference]: Without dead ends: 66 [2019-09-20 13:02:16,655 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:02:16,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-20 13:02:16,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-09-20 13:02:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-20 13:02:16,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-09-20 13:02:16,672 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 52 [2019-09-20 13:02:16,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:02:16,672 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-09-20 13:02:16,673 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:02:16,673 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-09-20 13:02:16,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-20 13:02:16,677 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:02:16,677 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:02:16,677 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:02:16,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:02:16,678 INFO L82 PathProgramCache]: Analyzing trace with hash -475790904, now seen corresponding path program 2 times [2019-09-20 13:02:16,678 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:02:16,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:02:16,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:02:16,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:02:16,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:02:18,237 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:02:18,237 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:02:18,237 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:18,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:02:18,394 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:02:18,394 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:02:18,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-20 13:02:18,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:02:18,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-20 13:02:18,452 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,467 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,468 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-20 13:02:18,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-09-20 13:02:18,548 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,558 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,558 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,559 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-09-20 13:02:18,620 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-20 13:02:18,621 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,632 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-20 13:02:18,702 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-09-20 13:02:18,703 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,712 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,712 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-20 13:02:18,870 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_28|], 5=[|v_#memory_$Pointer$.base_30|]} [2019-09-20 13:02:18,874 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:18,876 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2019-09-20 13:02:18,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,895 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,906 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:18,907 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:18,931 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:18,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 76 [2019-09-20 13:02:18,934 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,976 INFO L567 ElimStorePlain]: treesize reduction 32, result has 62.8 percent of original size [2019-09-20 13:02:18,978 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:18,979 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:67 [2019-09-20 13:02:19,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2019-09-20 13:02:19,494 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:19,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:19,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:19,513 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2019-09-20 13:02:19,656 INFO L392 ElimStorePlain]: Different costs {12=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_15|], 25=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_15|]} [2019-09-20 13:02:19,726 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:19,727 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 181 treesize of output 290 [2019-09-20 13:02:19,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:19,847 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-09-20 13:02:19,848 INFO L567 ElimStorePlain]: treesize reduction 398, result has 28.5 percent of original size [2019-09-20 13:02:19,852 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:19,858 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:19,957 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:19,958 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 155 treesize of output 339 [2019-09-20 13:02:19,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:19,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:19,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:19,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,986 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,991 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:19,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,997 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:19,999 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,002 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,008 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,009 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:20,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,407 WARN L191 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-09-20 13:02:20,407 INFO L567 ElimStorePlain]: treesize reduction 7072, result has 3.8 percent of original size [2019-09-20 13:02:20,408 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:02:20,408 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:211, output treesize:278 [2019-09-20 13:02:20,690 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-09-20 13:02:22,281 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_int)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_int)| |c_dll_circular_update_at_#in~head.base|) .cse0 dll_circular_update_at_~data)) |c_#memory_int|) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset)))) is different from true [2019-09-20 13:02:22,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:22,476 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_int)_AFTER_CALL_16|], 12=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|], 18=[|v_#memory_$Pointer$.base_BEFORE_CALL_4|]} [2019-09-20 13:02:22,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 135 [2019-09-20 13:02:22,500 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 138 [2019-09-20 13:02:22,521 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 148 [2019-09-20 13:02:22,544 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,707 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-09-20 13:02:22,708 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,735 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,738 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,742 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,754 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 125 [2019-09-20 13:02:22,755 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,766 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,768 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,817 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:22,818 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 143 [2019-09-20 13:02:22,819 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:22,831 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,834 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:22,840 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 159 treesize of output 145 [2019-09-20 13:02:22,841 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,122 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-20 13:02:23,122 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.1 percent of original size [2019-09-20 13:02:23,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,163 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 115 [2019-09-20 13:02:23,184 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,198 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,222 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:23,233 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,234 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 140 treesize of output 128 [2019-09-20 13:02:23,236 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,254 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:23,260 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:23,264 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:23,265 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 127 treesize of output 112 [2019-09-20 13:02:23,266 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:23,483 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-20 13:02:23,484 INFO L567 ElimStorePlain]: treesize reduction 90, result has 80.0 percent of original size [2019-09-20 13:02:23,485 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-09-20 13:02:23,485 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:467, output treesize:325 [2019-09-20 13:02:24,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:24,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:27,199 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-20 13:02:27,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:27,750 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 123 [2019-09-20 13:02:27,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,836 WARN L191 SmtUtils]: Spent 2.82 s on a formula simplification that was a NOOP. DAG size: 124 [2019-09-20 13:02:30,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,871 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,878 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,887 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,888 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,895 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,896 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,906 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-20 13:02:30,911 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,914 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,936 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_int|], 27=[|#memory_$Pointer$.offset|], 42=[|#memory_$Pointer$.base|]} [2019-09-20 13:02:30,946 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:30,946 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:30,972 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:30,978 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:30,979 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 176 [2019-09-20 13:02:30,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:30,981 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,014 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 208 [2019-09-20 13:02:31,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,017 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,027 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,027 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,036 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,037 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,071 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 246 treesize of output 208 [2019-09-20 13:02:31,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,073 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,086 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,087 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,118 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,118 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 256 treesize of output 218 [2019-09-20 13:02:31,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,120 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,134 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,134 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:31,158 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,159 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 163 [2019-09-20 13:02:31,159 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,191 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,192 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 205 [2019-09-20 13:02:31,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,194 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,225 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 243 treesize of output 205 [2019-09-20 13:02:31,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,227 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,240 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,240 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,251 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,252 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:02:31,276 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,276 INFO L375 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 163 [2019-09-20 13:02:31,277 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,287 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,288 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,306 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:02:31,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:02:31,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 236 treesize of output 182 [2019-09-20 13:02:31,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:02:31,313 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:31,322 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-20 13:02:31,323 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-09-20 13:02:32,743 WARN L191 SmtUtils]: Spent 1.42 s on a formula simplification. DAG size of input: 160 DAG size of output: 156 [2019-09-20 13:02:32,744 INFO L567 ElimStorePlain]: treesize reduction 80, result has 95.1 percent of original size [2019-09-20 13:02:32,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:02:32,947 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-20 13:02:32,954 INFO L168 Benchmark]: Toolchain (without parser) took 20373.73 ms. Allocated memory was 132.6 MB in the beginning and 381.7 MB in the end (delta: 249.0 MB). Free memory was 87.2 MB in the beginning and 256.1 MB in the end (delta: -169.0 MB). Peak memory consumption was 237.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:02:32,955 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:02:32,955 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.96 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 87.0 MB in the beginning and 161.6 MB in the end (delta: -74.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:02:32,956 INFO L168 Benchmark]: Boogie Preprocessor took 72.47 ms. Allocated memory is still 201.3 MB. Free memory was 161.6 MB in the beginning and 159.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:02:32,957 INFO L168 Benchmark]: RCFGBuilder took 738.21 ms. Allocated memory is still 201.3 MB. Free memory was 159.1 MB in the beginning and 109.3 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:02:32,958 INFO L168 Benchmark]: TraceAbstraction took 18803.73 ms. Allocated memory was 201.3 MB in the beginning and 381.7 MB in the end (delta: 180.4 MB). Free memory was 108.7 MB in the beginning and 256.1 MB in the end (delta: -147.4 MB). Peak memory consumption was 190.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:02:32,962 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 132.6 MB. Free memory was 106.8 MB in the beginning and 106.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 753.96 ms. Allocated memory was 132.6 MB in the beginning and 201.3 MB in the end (delta: 68.7 MB). Free memory was 87.0 MB in the beginning and 161.6 MB in the end (delta: -74.7 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.47 ms. Allocated memory is still 201.3 MB. Free memory was 161.6 MB in the beginning and 159.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 738.21 ms. Allocated memory is still 201.3 MB. Free memory was 159.1 MB in the beginning and 109.3 MB in the end (delta: 49.8 MB). Peak memory consumption was 49.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18803.73 ms. Allocated memory was 201.3 MB in the beginning and 381.7 MB in the end (delta: 180.4 MB). Free memory was 108.7 MB in the beginning and 256.1 MB in the end (delta: -147.4 MB). Peak memory consumption was 190.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...