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-efa34d5 [2019-09-16 16:29:08,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:29:08,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:29:08,450 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:29:08,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:29:08,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:29:08,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:29:08,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:29:08,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:29:08,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:29:08,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:29:08,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:29:08,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:29:08,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:29:08,485 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:29:08,486 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:29:08,488 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:29:08,489 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:29:08,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:29:08,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:29:08,501 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:29:08,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:29:08,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:29:08,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:29:08,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:29:08,510 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:29:08,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:29:08,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:29:08,513 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:29:08,514 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:29:08,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:29:08,516 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:29:08,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:29:08,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:29:08,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:29:08,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:29:08,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:29:08,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:29:08,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:29:08,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:29:08,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:29:08,525 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-16 16:29:08,563 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:29:08,564 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:29:08,566 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:29:08,566 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:29:08,566 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:29:08,566 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:29:08,567 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:29:08,567 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:29:08,567 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:29:08,567 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:29:08,567 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:29:08,568 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:29:08,568 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:29:08,568 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:29:08,571 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:29:08,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:29:08,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:29:08,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:29:08,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:29:08,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:29:08,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:29:08,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:29:08,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:29:08,576 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:29:08,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:29:08,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:29:08,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:29:08,577 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:29:08,577 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:29:08,634 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:29:08,649 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:29:08,655 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:29:08,657 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:29:08,658 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:29:08,658 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-16 16:29:08,723 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853515881/6fdbb81866df48e8883a5afde512e98f/FLAG6a10ca3ce [2019-09-16 16:29:09,199 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:29:09,200 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2019-09-16 16:29:09,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853515881/6fdbb81866df48e8883a5afde512e98f/FLAG6a10ca3ce [2019-09-16 16:29:09,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/853515881/6fdbb81866df48e8883a5afde512e98f [2019-09-16 16:29:09,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:29:09,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:29:09,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:29:09,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:29:09,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:29:09,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:29:09" (1/1) ... [2019-09-16 16:29:09,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fe22a9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:09, skipping insertion in model container [2019-09-16 16:29:09,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:29:09" (1/1) ... [2019-09-16 16:29:09,592 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:29:09,657 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:29:10,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:29:10,192 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:29:10,241 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:29:10,309 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:29:10,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10 WrapperNode [2019-09-16 16:29:10,310 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:29:10,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:29:10,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:29:10,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:29:10,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (1/1) ... [2019-09-16 16:29:10,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (1/1) ... [2019-09-16 16:29:10,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (1/1) ... [2019-09-16 16:29:10,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (1/1) ... [2019-09-16 16:29:10,356 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (1/1) ... [2019-09-16 16:29:10,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (1/1) ... [2019-09-16 16:29:10,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (1/1) ... [2019-09-16 16:29:10,381 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:29:10,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:29:10,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:29:10,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:29:10,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (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-16 16:29:10,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:29:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:29:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-16 16:29:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-16 16:29:10,450 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-16 16:29:10,451 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-09-16 16:29:10,451 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-09-16 16:29:10,451 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-09-16 16:29:10,451 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-09-16 16:29:10,452 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-09-16 16:29:10,452 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:29:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:29:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-16 16:29:10,452 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-16 16:29:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-16 16:29:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-16 16:29:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-16 16:29:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-16 16:29:10,453 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-16 16:29:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-16 16:29:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-16 16:29:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-16 16:29:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-16 16:29:10,454 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-16 16:29:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-16 16:29:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-16 16:29:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-16 16:29:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-16 16:29:10,455 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-16 16:29:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-16 16:29:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-16 16:29:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-16 16:29:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-16 16:29:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-16 16:29:10,456 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-16 16:29:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-16 16:29:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-16 16:29:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-16 16:29:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-16 16:29:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-16 16:29:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-16 16:29:10,457 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-16 16:29:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-16 16:29:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-16 16:29:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-16 16:29:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-16 16:29:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-16 16:29:10,458 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-16 16:29:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-16 16:29:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-16 16:29:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-16 16:29:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-16 16:29:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-16 16:29:10,459 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-16 16:29:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-16 16:29:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-16 16:29:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-16 16:29:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-16 16:29:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-16 16:29:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-16 16:29:10,460 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-16 16:29:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-16 16:29:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-16 16:29:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-16 16:29:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:29:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:29:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-16 16:29:10,461 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:29:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-16 16:29:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-16 16:29:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-16 16:29:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-16 16:29:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-16 16:29:10,462 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-16 16:29:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-16 16:29:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-16 16:29:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-16 16:29:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-16 16:29:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-16 16:29:10,463 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-16 16:29:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-16 16:29:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-16 16:29:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-16 16:29:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-16 16:29:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-16 16:29:10,464 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-16 16:29:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-16 16:29:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-16 16:29:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-16 16:29:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-16 16:29:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-16 16:29:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-16 16:29:10,465 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-16 16:29:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-16 16:29:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-16 16:29:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-16 16:29:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-16 16:29:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-16 16:29:10,466 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-16 16:29:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-16 16:29:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-16 16:29:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-16 16:29:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-16 16:29:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-16 16:29:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-16 16:29:10,467 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-16 16:29:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-16 16:29:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-16 16:29:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-16 16:29:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-16 16:29:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-16 16:29:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-16 16:29:10,468 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-16 16:29:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-16 16:29:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-16 16:29:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-16 16:29:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-16 16:29:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-16 16:29:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-09-16 16:29:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:29:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:29:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:29:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-09-16 16:29:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-09-16 16:29:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:29:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:29:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-09-16 16:29:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:29:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-09-16 16:29:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:29:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:29:10,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:29:10,940 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-16 16:29:11,064 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:29:11,064 INFO L283 CfgBuilder]: Removed 6 assume(true) statements. [2019-09-16 16:29:11,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:29:11 BoogieIcfgContainer [2019-09-16 16:29:11,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:29:11,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:29:11,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:29:11,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:29:11,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:29:09" (1/3) ... [2019-09-16 16:29:11,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dd5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:29:11, skipping insertion in model container [2019-09-16 16:29:11,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:29:10" (2/3) ... [2019-09-16 16:29:11,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24dd5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:29:11, skipping insertion in model container [2019-09-16 16:29:11,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:29:11" (3/3) ... [2019-09-16 16:29:11,088 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.i [2019-09-16 16:29:11,100 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:29:11,111 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:29:11,130 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:29:11,171 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:29:11,172 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:29:11,172 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:29:11,173 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:29:11,173 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:29:11,173 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:29:11,173 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:29:11,173 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:29:11,174 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:29:11,197 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-09-16 16:29:11,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:29:11,207 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:11,208 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-16 16:29:11,211 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:11,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-09-16 16:29:11,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:11,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:11,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:11,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:11,467 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-16 16:29:11,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:29:11,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:29:11,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:29:11,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:29:11,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:29:11,497 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2019-09-16 16:29:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:11,529 INFO L93 Difference]: Finished difference Result 97 states and 127 transitions. [2019-09-16 16:29:11,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:29:11,531 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-09-16 16:29:11,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:11,541 INFO L225 Difference]: With dead ends: 97 [2019-09-16 16:29:11,541 INFO L226 Difference]: Without dead ends: 45 [2019-09-16 16:29:11,545 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-16 16:29:11,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-09-16 16:29:11,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-09-16 16:29:11,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-09-16 16:29:11,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-09-16 16:29:11,593 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-09-16 16:29:11,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:11,595 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-09-16 16:29:11,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:29:11,596 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-09-16 16:29:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-16 16:29:11,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:11,599 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-16 16:29:11,599 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:11,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:11,600 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-09-16 16:29:11,600 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:11,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:11,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:11,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:11,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:11,721 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-16 16:29:11,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:29:11,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-16 16:29:11,728 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-16 16:29:11,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-16 16:29:11,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-16 16:29:11,729 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 4 states. [2019-09-16 16:29:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:11,814 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2019-09-16 16:29:11,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-16 16:29:11,815 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-09-16 16:29:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:11,817 INFO L225 Difference]: With dead ends: 68 [2019-09-16 16:29:11,817 INFO L226 Difference]: Without dead ends: 55 [2019-09-16 16:29:11,819 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-16 16:29:11,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-16 16:29:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 46. [2019-09-16 16:29:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-16 16:29:11,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-09-16 16:29:11,830 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-09-16 16:29:11,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:11,830 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-09-16 16:29:11,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-16 16:29:11,830 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-09-16 16:29:11,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-16 16:29:11,832 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:11,832 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-16 16:29:11,832 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:11,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:11,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2064355028, now seen corresponding path program 1 times [2019-09-16 16:29:11,833 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:11,833 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:11,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:11,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:11,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:12,132 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-16 16:29:12,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:12,133 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-16 16:29:12,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:12,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:12,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:29:12,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:12,327 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-16 16:29:12,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:29:12,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 13 [2019-09-16 16:29:12,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-16 16:29:12,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-16 16:29:12,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-16 16:29:12,342 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 13 states. [2019-09-16 16:29:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:12,559 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-16 16:29:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-16 16:29:12,560 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2019-09-16 16:29:12,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:12,563 INFO L225 Difference]: With dead ends: 85 [2019-09-16 16:29:12,563 INFO L226 Difference]: Without dead ends: 59 [2019-09-16 16:29:12,564 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-16 16:29:12,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-09-16 16:29:12,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 47. [2019-09-16 16:29:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-09-16 16:29:12,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-09-16 16:29:12,573 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 40 [2019-09-16 16:29:12,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:12,574 INFO L475 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-09-16 16:29:12,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-16 16:29:12,574 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-09-16 16:29:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-16 16:29:12,576 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:12,576 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-16 16:29:12,576 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:12,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:12,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-09-16 16:29:12,577 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:12,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:12,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:12,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:12,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:12,756 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-16 16:29:12,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:12,757 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-16 16:29:12,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:12,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:12,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:29:12,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:12,955 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-16 16:29:12,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-16 16:29:12,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2019-09-16 16:29:12,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-16 16:29:12,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-16 16:29:12,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-16 16:29:12,962 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 11 states. [2019-09-16 16:29:13,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:13,150 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2019-09-16 16:29:13,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-16 16:29:13,151 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 50 [2019-09-16 16:29:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:13,153 INFO L225 Difference]: With dead ends: 85 [2019-09-16 16:29:13,153 INFO L226 Difference]: Without dead ends: 64 [2019-09-16 16:29:13,154 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-16 16:29:13,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-09-16 16:29:13,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 58. [2019-09-16 16:29:13,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-16 16:29:13,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2019-09-16 16:29:13,166 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 50 [2019-09-16 16:29:13,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:13,167 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2019-09-16 16:29:13,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-16 16:29:13,167 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2019-09-16 16:29:13,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-16 16:29:13,169 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:13,169 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-16 16:29:13,169 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:13,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:13,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1662053774, now seen corresponding path program 1 times [2019-09-16 16:29:13,170 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:13,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:13,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:13,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:13,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:13,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:13,271 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-16 16:29:13,271 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:13,271 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-16 16:29:13,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:13,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:13,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-16 16:29:13,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:13,436 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-16 16:29:13,441 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:29:13,441 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-16 16:29:13,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:29:13,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:29:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:29:13,444 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand 5 states. [2019-09-16 16:29:13,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:29:13,521 INFO L93 Difference]: Finished difference Result 85 states and 99 transitions. [2019-09-16 16:29:13,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:29:13,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-09-16 16:29:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:29:13,523 INFO L225 Difference]: With dead ends: 85 [2019-09-16 16:29:13,523 INFO L226 Difference]: Without dead ends: 66 [2019-09-16 16:29:13,526 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-16 16:29:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-09-16 16:29:13,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2019-09-16 16:29:13,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-09-16 16:29:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 70 transitions. [2019-09-16 16:29:13,544 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 70 transitions. Word has length 52 [2019-09-16 16:29:13,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:29:13,544 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 70 transitions. [2019-09-16 16:29:13,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:29:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 70 transitions. [2019-09-16 16:29:13,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-09-16 16:29:13,549 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:29:13,549 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-16 16:29:13,549 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:29:13,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:29:13,550 INFO L82 PathProgramCache]: Analyzing trace with hash -475790904, now seen corresponding path program 2 times [2019-09-16 16:29:13,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:29:13,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:29:13,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:13,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:29:13,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:29:13,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:29:15,290 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-16 16:29:15,290 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:29:15,290 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-16 16:29:15,364 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-16 16:29:15,466 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-16 16:29:15,466 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-16 16:29:15,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 128 conjunts are in the unsatisfiable core [2019-09-16 16:29:15,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:29:15,521 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-16 16:29:15,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,531 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:15,531 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,532 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-09-16 16:29:15,616 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:15,617 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-16 16:29:15,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:15,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,626 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-09-16 16:29:15,698 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-16 16:29:15,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:15,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,710 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-09-16 16:29:15,784 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-16 16:29:15,785 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,794 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:15,794 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,795 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-09-16 16:29:15,929 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_28|], 5=[|v_#memory_$Pointer$.base_30|]} [2019-09-16 16:29:15,943 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:15,945 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-16 16:29:15,945 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:15,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:15,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:15,970 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:29:15,996 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:15,997 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-16 16:29:15,998 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:16,032 INFO L567 ElimStorePlain]: treesize reduction 32, result has 62.8 percent of original size [2019-09-16 16:29:16,033 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-16 16:29:16,034 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:88, output treesize:67 [2019-09-16 16:29:16,628 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-16 16:29:16,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:16,645 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:16,646 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-16 16:29:16,647 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:110, output treesize:113 [2019-09-16 16:29:16,765 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-16 16:29:16,864 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:16,865 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-16 16:29:16,870 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:16,876 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:16,985 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 50 [2019-09-16 16:29:16,986 INFO L567 ElimStorePlain]: treesize reduction 398, result has 28.5 percent of original size [2019-09-16 16:29:16,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:16,998 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:29:17,112 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-09-16 16:29:17,112 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:17,113 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-16 16:29:17,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:17,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:17,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,121 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,122 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,132 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,135 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:17,136 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,137 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,142 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,144 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,145 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,149 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:17,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,154 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,167 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:17,172 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:17,518 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 50 [2019-09-16 16:29:17,519 INFO L567 ElimStorePlain]: treesize reduction 7072, result has 3.8 percent of original size [2019-09-16 16:29:17,520 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:29:17,520 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:211, output treesize:278 [2019-09-16 16:29:19,459 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-16 16:29:19,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,483 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,486 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:19,658 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-16 16:29:19,692 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-16 16:29:19,693 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:19,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,717 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-16 16:29:19,718 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:19,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 148 [2019-09-16 16:29:19,732 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:19,890 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2019-09-16 16:29:19,891 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:19,907 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,909 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,924 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-16 16:29:19,925 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:19,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,959 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:19,960 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-16 16:29:19,961 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:19,968 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,970 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:19,982 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-16 16:29:19,984 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:20,273 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-09-16 16:29:20,273 INFO L567 ElimStorePlain]: treesize reduction 16, result has 96.1 percent of original size [2019-09-16 16:29:20,284 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,310 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:20,311 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-16 16:29:20,312 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:20,320 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,353 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:29:20,365 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:20,366 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-16 16:29:20,369 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:20,385 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,386 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,403 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:20,405 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:29:20,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:20,410 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-16 16:29:20,412 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:20,620 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-09-16 16:29:20,623 INFO L567 ElimStorePlain]: treesize reduction 90, result has 80.0 percent of original size [2019-09-16 16:29:20,624 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-16 16:29:20,624 INFO L221 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:467, output treesize:325 [2019-09-16 16:29:21,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,172 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,173 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:21,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:26,674 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2019-09-16 16:29:26,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:35,600 WARN L191 SmtUtils]: Spent 8.66 s on a formula simplification that was a NOOP. DAG size: 123 [2019-09-16 16:29:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,339 WARN L191 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-09-16 16:29:36,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,424 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,444 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-16 16:29:36,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,495 INFO L392 ElimStorePlain]: Different costs {12=[|#memory_int|], 27=[|#memory_$Pointer$.offset|], 42=[|#memory_$Pointer$.base|]} [2019-09-16 16:29:36,509 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,509 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,557 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,558 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-16 16:29:36,559 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,560 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,582 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:29:36,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,590 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-16 16:29:36,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,592 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,603 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,604 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,614 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,615 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,651 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,652 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-16 16:29:36,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,654 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,669 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,670 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,706 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,706 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-16 16:29:36,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,708 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,724 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,724 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,760 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-16 16:29:36,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,762 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,785 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:36,787 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,788 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-16 16:29:36,789 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,827 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,827 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-16 16:29:36,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,829 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,843 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,844 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,855 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,855 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:29:36,880 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,881 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-16 16:29:36,882 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,893 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,893 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,916 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:29:36,922 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:29:36,923 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-16 16:29:36,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:29:36,924 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:36,934 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-16 16:29:36,935 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-09-16 16:29:38,349 WARN L191 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 160 DAG size of output: 156 [2019-09-16 16:29:38,350 INFO L567 ElimStorePlain]: treesize reduction 80, result has 95.1 percent of original size [2019-09-16 16:29:38,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:29:38,553 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:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) 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-16 16:29:38,558 INFO L168 Benchmark]: Toolchain (without parser) took 28979.42 ms. Allocated memory was 134.2 MB in the beginning and 391.1 MB in the end (delta: 256.9 MB). Free memory was 88.1 MB in the beginning and 301.3 MB in the end (delta: -213.2 MB). Peak memory consumption was 244.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:38,559 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 134.2 MB. Free memory was 108.3 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:29:38,560 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.24 ms. Allocated memory was 134.2 MB in the beginning and 198.2 MB in the end (delta: 64.0 MB). Free memory was 87.8 MB in the beginning and 159.1 MB in the end (delta: -71.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:38,561 INFO L168 Benchmark]: Boogie Preprocessor took 69.79 ms. Allocated memory is still 198.2 MB. Free memory was 159.1 MB in the beginning and 156.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:38,562 INFO L168 Benchmark]: RCFGBuilder took 685.37 ms. Allocated memory is still 198.2 MB. Free memory was 156.1 MB in the beginning and 107.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:38,562 INFO L168 Benchmark]: TraceAbstraction took 27488.67 ms. Allocated memory was 198.2 MB in the beginning and 391.1 MB in the end (delta: 192.9 MB). Free memory was 107.0 MB in the beginning and 301.3 MB in the end (delta: -194.3 MB). Peak memory consumption was 199.2 MB. Max. memory is 7.1 GB. [2019-09-16 16:29:38,566 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.50 ms. Allocated memory is still 134.2 MB. Free memory was 108.3 MB in the beginning and 108.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 731.24 ms. Allocated memory was 134.2 MB in the beginning and 198.2 MB in the end (delta: 64.0 MB). Free memory was 87.8 MB in the beginning and 159.1 MB in the end (delta: -71.3 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.79 ms. Allocated memory is still 198.2 MB. Free memory was 159.1 MB in the beginning and 156.1 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 685.37 ms. Allocated memory is still 198.2 MB. Free memory was 156.1 MB in the beginning and 107.0 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 27488.67 ms. Allocated memory was 198.2 MB in the beginning and 391.1 MB in the end (delta: 192.9 MB). Free memory was 107.0 MB in the beginning and 301.3 MB in the end (delta: -194.3 MB). Peak memory consumption was 199.2 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...