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/heap-manipulation/dll_of_dll-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 02:03:47,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 02:03:47,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 02:03:47,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 02:03:47,615 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 02:03:47,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 02:03:47,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 02:03:47,619 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 02:03:47,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 02:03:47,622 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 02:03:47,623 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 02:03:47,624 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 02:03:47,624 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 02:03:47,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 02:03:47,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 02:03:47,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 02:03:47,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 02:03:47,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 02:03:47,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 02:03:47,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 02:03:47,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 02:03:47,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 02:03:47,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 02:03:47,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 02:03:47,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 02:03:47,647 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 02:03:47,647 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 02:03:47,648 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 02:03:47,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 02:03:47,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 02:03:47,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 02:03:47,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 02:03:47,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 02:03:47,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 02:03:47,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 02:03:47,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 02:03:47,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 02:03:47,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 02:03:47,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 02:03:47,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 02:03:47,662 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 02:03:47,663 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-10-02 02:03:47,691 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 02:03:47,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 02:03:47,694 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 02:03:47,694 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 02:03:47,694 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 02:03:47,695 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 02:03:47,695 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 02:03:47,695 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 02:03:47,696 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 02:03:47,696 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 02:03:47,697 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 02:03:47,697 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 02:03:47,697 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 02:03:47,698 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 02:03:47,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 02:03:47,698 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 02:03:47,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 02:03:47,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 02:03:47,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 02:03:47,699 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 02:03:47,700 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 02:03:47,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 02:03:47,700 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 02:03:47,700 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 02:03:47,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 02:03:47,701 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 02:03:47,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 02:03:47,701 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 02:03:47,702 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 02:03:47,764 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 02:03:47,778 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 02:03:47,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 02:03:47,785 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 02:03:47,785 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 02:03:47,786 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2019-10-02 02:03:47,856 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/facb78234/3d31f25ddf404fea824d74d7b0615e80/FLAGf724b15d2 [2019-10-02 02:03:48,333 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 02:03:48,333 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2019-10-02 02:03:48,351 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/facb78234/3d31f25ddf404fea824d74d7b0615e80/FLAGf724b15d2 [2019-10-02 02:03:48,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/facb78234/3d31f25ddf404fea824d74d7b0615e80 [2019-10-02 02:03:48,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 02:03:48,694 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 02:03:48,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 02:03:48,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 02:03:48,699 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 02:03:48,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:03:48" (1/1) ... [2019-10-02 02:03:48,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f98327e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:48, skipping insertion in model container [2019-10-02 02:03:48,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 02:03:48" (1/1) ... [2019-10-02 02:03:48,709 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 02:03:48,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 02:03:49,320 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 02:03:49,330 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 02:03:49,388 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 02:03:49,460 INFO L192 MainTranslator]: Completed translation [2019-10-02 02:03:49,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49 WrapperNode [2019-10-02 02:03:49,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 02:03:49,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 02:03:49,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 02:03:49,461 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 02:03:49,472 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (1/1) ... [2019-10-02 02:03:49,472 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (1/1) ... [2019-10-02 02:03:49,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (1/1) ... [2019-10-02 02:03:49,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (1/1) ... [2019-10-02 02:03:49,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (1/1) ... [2019-10-02 02:03:49,555 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (1/1) ... [2019-10-02 02:03:49,563 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (1/1) ... [2019-10-02 02:03:49,577 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 02:03:49,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 02:03:49,584 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 02:03:49,584 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 02:03:49,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (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-10-02 02:03:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 02:03:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 02:03:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 02:03:49,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-02 02:03:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-02 02:03:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-02 02:03:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_slave [2019-10-02 02:03:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_master [2019-10-02 02:03:49,635 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_slave [2019-10-02 02:03:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2019-10-02 02:03:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2019-10-02 02:03:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_slave [2019-10-02 02:03:49,636 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_nested_lists [2019-10-02 02:03:49,637 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_reinit_nested_lists [2019-10-02 02:03:49,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_master [2019-10-02 02:03:49,638 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2019-10-02 02:03:49,641 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_master [2019-10-02 02:03:49,641 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2019-10-02 02:03:49,641 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_full [2019-10-02 02:03:49,641 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_dangling [2019-10-02 02:03:49,641 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_init [2019-10-02 02:03:49,642 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 02:03:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 02:03:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-02 02:03:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-02 02:03:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-02 02:03:49,642 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-02 02:03:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-02 02:03:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-02 02:03:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-02 02:03:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-02 02:03:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-02 02:03:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-02 02:03:49,643 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-02 02:03:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-02 02:03:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-02 02:03:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-02 02:03:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-02 02:03:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-02 02:03:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-02 02:03:49,644 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-02 02:03:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-02 02:03:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-02 02:03:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-02 02:03:49,645 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-02 02:03:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-02 02:03:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-02 02:03:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-02 02:03:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-02 02:03:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-02 02:03:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-02 02:03:49,646 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-02 02:03:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-02 02:03:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-02 02:03:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-02 02:03:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-02 02:03:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-02 02:03:49,647 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-02 02:03:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-02 02:03:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-02 02:03:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-02 02:03:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-02 02:03:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-02 02:03:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-02 02:03:49,648 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-02 02:03:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-02 02:03:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-02 02:03:49,649 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-02 02:03:49,650 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-02 02:03:49,651 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-02 02:03:49,651 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-02 02:03:49,651 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-02 02:03:49,651 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-02 02:03:49,651 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-02 02:03:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-02 02:03:49,652 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 02:03:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 02:03:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-02 02:03:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 02:03:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-02 02:03:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-02 02:03:49,653 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-02 02:03:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-02 02:03:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-02 02:03:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-02 02:03:49,654 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-02 02:03:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-02 02:03:49,655 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-02 02:03:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 02:03:49,656 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-02 02:03:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-02 02:03:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-02 02:03:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-02 02:03:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-02 02:03:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-02 02:03:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-02 02:03:49,657 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-02 02:03:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-02 02:03:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-02 02:03:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-02 02:03:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-02 02:03:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-02 02:03:49,658 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-02 02:03:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-02 02:03:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-02 02:03:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-02 02:03:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-02 02:03:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-02 02:03:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-02 02:03:49,659 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-02 02:03:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-02 02:03:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-02 02:03:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-02 02:03:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-02 02:03:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-02 02:03:49,660 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-02 02:03:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-02 02:03:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-02 02:03:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-02 02:03:49,661 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-02 02:03:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-02 02:03:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-02 02:03:49,662 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-02 02:03:49,663 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_slave [2019-10-02 02:03:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 02:03:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 02:03:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_master [2019-10-02 02:03:49,664 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_slave [2019-10-02 02:03:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 02:03:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2019-10-02 02:03:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 02:03:49,665 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2019-10-02 02:03:49,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 02:03:49,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 02:03:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2019-10-02 02:03:49,670 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_slave [2019-10-02 02:03:49,671 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_nested_lists [2019-10-02 02:03:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure dll_reinit_nested_lists [2019-10-02 02:03:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_master [2019-10-02 02:03:49,678 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2019-10-02 02:03:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_master [2019-10-02 02:03:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2019-10-02 02:03:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_full [2019-10-02 02:03:49,679 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_dangling [2019-10-02 02:03:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_init [2019-10-02 02:03:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 02:03:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 02:03:49,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 02:03:50,499 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 02:03:50,499 INFO L283 CfgBuilder]: Removed 38 assume(true) statements. [2019-10-02 02:03:50,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:03:50 BoogieIcfgContainer [2019-10-02 02:03:50,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 02:03:50,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 02:03:50,503 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 02:03:50,506 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 02:03:50,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 02:03:48" (1/3) ... [2019-10-02 02:03:50,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab03226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:03:50, skipping insertion in model container [2019-10-02 02:03:50,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 02:03:49" (2/3) ... [2019-10-02 02:03:50,508 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ab03226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 02:03:50, skipping insertion in model container [2019-10-02 02:03:50,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 02:03:50" (3/3) ... [2019-10-02 02:03:50,510 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2019-10-02 02:03:50,521 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 02:03:50,533 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 02:03:50,550 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 02:03:50,591 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 02:03:50,591 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 02:03:50,592 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 02:03:50,592 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 02:03:50,592 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 02:03:50,593 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 02:03:50,593 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 02:03:50,593 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 02:03:50,593 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 02:03:50,625 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2019-10-02 02:03:50,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-02 02:03:50,639 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:50,641 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-10-02 02:03:50,644 INFO L418 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:50,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:50,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1405399524, now seen corresponding path program 1 times [2019-10-02 02:03:50,653 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:50,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:50,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:50,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:50,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 02:03:50,928 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:03:50,928 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-10-02 02:03:51,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:51,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 02:03:51,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:03:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-02 02:03:51,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 02:03:51,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2019-10-02 02:03:51,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 02:03:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 02:03:51,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 02:03:51,196 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 2 states. [2019-10-02 02:03:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:03:51,301 INFO L93 Difference]: Finished difference Result 329 states and 517 transitions. [2019-10-02 02:03:51,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 02:03:51,303 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 59 [2019-10-02 02:03:51,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:03:51,329 INFO L225 Difference]: With dead ends: 329 [2019-10-02 02:03:51,329 INFO L226 Difference]: Without dead ends: 155 [2019-10-02 02:03:51,339 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 60 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-10-02 02:03:51,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-10-02 02:03:51,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2019-10-02 02:03:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2019-10-02 02:03:51,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 184 transitions. [2019-10-02 02:03:51,390 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 184 transitions. Word has length 59 [2019-10-02 02:03:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:03:51,390 INFO L475 AbstractCegarLoop]: Abstraction has 155 states and 184 transitions. [2019-10-02 02:03:51,390 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 02:03:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 184 transitions. [2019-10-02 02:03:51,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-02 02:03:51,394 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:51,394 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-10-02 02:03:51,394 INFO L418 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash 747676979, now seen corresponding path program 1 times [2019-10-02 02:03:51,395 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:51,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:51,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:51,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:51,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:51,916 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 02:03:51,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 02:03:51,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-10-02 02:03:51,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-02 02:03:51,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-02 02:03:51,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2019-10-02 02:03:51,920 INFO L87 Difference]: Start difference. First operand 155 states and 184 transitions. Second operand 21 states. [2019-10-02 02:03:52,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:03:52,892 INFO L93 Difference]: Finished difference Result 336 states and 416 transitions. [2019-10-02 02:03:52,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 02:03:52,893 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 60 [2019-10-02 02:03:52,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:03:52,897 INFO L225 Difference]: With dead ends: 336 [2019-10-02 02:03:52,897 INFO L226 Difference]: Without dead ends: 267 [2019-10-02 02:03:52,899 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2019-10-02 02:03:52,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-02 02:03:52,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 217. [2019-10-02 02:03:52,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-10-02 02:03:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 264 transitions. [2019-10-02 02:03:52,927 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 264 transitions. Word has length 60 [2019-10-02 02:03:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:03:52,928 INFO L475 AbstractCegarLoop]: Abstraction has 217 states and 264 transitions. [2019-10-02 02:03:52,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-02 02:03:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 264 transitions. [2019-10-02 02:03:52,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-02 02:03:52,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:52,931 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-10-02 02:03:52,931 INFO L418 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:52,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:52,932 INFO L82 PathProgramCache]: Analyzing trace with hash 65445028, now seen corresponding path program 1 times [2019-10-02 02:03:52,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:52,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:52,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:52,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:53,151 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 02:03:53,152 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:03:53,152 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-10-02 02:03:53,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:53,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 02:03:53,317 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:03:53,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-02 02:03:53,391 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 02:03:53,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:03:53,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-10-02 02:03:53,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 02:03:53,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 02:03:53,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 02:03:53,406 INFO L87 Difference]: Start difference. First operand 217 states and 264 transitions. Second operand 5 states. [2019-10-02 02:03:53,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:03:53,575 INFO L93 Difference]: Finished difference Result 378 states and 471 transitions. [2019-10-02 02:03:53,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 02:03:53,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-10-02 02:03:53,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:03:53,584 INFO L225 Difference]: With dead ends: 378 [2019-10-02 02:03:53,584 INFO L226 Difference]: Without dead ends: 168 [2019-10-02 02:03:53,585 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 02:03:53,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2019-10-02 02:03:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2019-10-02 02:03:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-10-02 02:03:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2019-10-02 02:03:53,608 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 63 [2019-10-02 02:03:53,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:03:53,609 INFO L475 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2019-10-02 02:03:53,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 02:03:53,609 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2019-10-02 02:03:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-10-02 02:03:53,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:53,615 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 02:03:53,616 INFO L418 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:53,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:53,616 INFO L82 PathProgramCache]: Analyzing trace with hash 586330229, now seen corresponding path program 1 times [2019-10-02 02:03:53,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:53,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:53,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2019-10-02 02:03:54,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:03:54,067 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-10-02 02:03:54,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:54,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 50 conjunts are in the unsatisfiable core [2019-10-02 02:03:54,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:03:54,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:54,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2019-10-02 02:03:54,410 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:54,450 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-10-02 02:03:54,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:54,452 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2019-10-02 02:03:54,494 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-10-02 02:03:54,495 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:54,497 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:54,497 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:54,498 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-02 02:03:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 36 proven. 5 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 02:03:54,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:03:54,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22] total 24 [2019-10-02 02:03:54,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-02 02:03:54,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-02 02:03:54,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2019-10-02 02:03:54,547 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 24 states. [2019-10-02 02:03:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:03:55,352 INFO L93 Difference]: Finished difference Result 299 states and 361 transitions. [2019-10-02 02:03:55,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 02:03:55,353 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 154 [2019-10-02 02:03:55,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:03:55,361 INFO L225 Difference]: With dead ends: 299 [2019-10-02 02:03:55,361 INFO L226 Difference]: Without dead ends: 229 [2019-10-02 02:03:55,362 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=845, Unknown=0, NotChecked=0, Total=930 [2019-10-02 02:03:55,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-02 02:03:55,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 194. [2019-10-02 02:03:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-10-02 02:03:55,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2019-10-02 02:03:55,404 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 154 [2019-10-02 02:03:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:03:55,405 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2019-10-02 02:03:55,408 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-02 02:03:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2019-10-02 02:03:55,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 02:03:55,414 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:03:55,414 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 02:03:55,414 INFO L418 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:03:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:03:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash -547179998, now seen corresponding path program 1 times [2019-10-02 02:03:55,415 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:03:55,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:03:55,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:55,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:55,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:03:55,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:56,119 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 108 proven. 11 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 02:03:56,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:03:56,120 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-10-02 02:03:56,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:03:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:03:56,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-02 02:03:56,356 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:03:56,417 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-10-02 02:03:56,417 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:56,423 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:56,424 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:56,424 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2019-10-02 02:03:56,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-02 02:03:56,470 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:03:56,475 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:03:56,476 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:03:56,477 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 02:03:57,568 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ |c_#StackHeapBarrier| 1) alloc_or_die_slave_~ptr~0.base) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0))))) is different from true [2019-10-02 02:04:05,996 WARN L191 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 22 [2019-10-02 02:04:06,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:06,129 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 02:04:06,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:06,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:06,132 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:06,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:1 [2019-10-02 02:04:06,165 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 114 proven. 9 refuted. 0 times theorem prover too weak. 55 trivial. 2 not checked. [2019-10-02 02:04:06,178 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:04:06,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 29 [2019-10-02 02:04:06,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-02 02:04:06,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-02 02:04:06,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=673, Unknown=7, NotChecked=52, Total=812 [2019-10-02 02:04:06,181 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 29 states. [2019-10-02 02:04:09,845 WARN L191 SmtUtils]: Spent 2.53 s on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-10-02 02:04:11,167 WARN L191 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 25 [2019-10-02 02:04:23,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:04:23,456 INFO L93 Difference]: Finished difference Result 390 states and 472 transitions. [2019-10-02 02:04:23,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 02:04:23,458 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 157 [2019-10-02 02:04:23,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:04:23,461 INFO L225 Difference]: With dead ends: 390 [2019-10-02 02:04:23,461 INFO L226 Difference]: Without dead ends: 207 [2019-10-02 02:04:23,463 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 155 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 332 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=180, Invalid=1538, Unknown=8, NotChecked=80, Total=1806 [2019-10-02 02:04:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-02 02:04:23,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2019-10-02 02:04:23,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-02 02:04:23,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 239 transitions. [2019-10-02 02:04:23,479 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 239 transitions. Word has length 157 [2019-10-02 02:04:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:04:23,479 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 239 transitions. [2019-10-02 02:04:23,479 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-02 02:04:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2019-10-02 02:04:23,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 02:04:23,482 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:04:23,482 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 02:04:23,483 INFO L418 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:04:23,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:04:23,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1779393950, now seen corresponding path program 1 times [2019-10-02 02:04:23,483 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:04:23,483 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:04:23,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:23,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:04:23,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:23,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 15 proven. 33 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2019-10-02 02:04:23,988 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:04:23,988 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:04:24,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:04:24,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:24,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 52 conjunts are in the unsatisfiable core [2019-10-02 02:04:24,231 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:04:24,271 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-02 02:04:24,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:24,280 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:24,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-02 02:04:24,286 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:24,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:24,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:24,295 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-10-02 02:04:26,349 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (let ((.cse0 (+ alloc_or_die_master_~ptr~1.offset 4)) (.cse1 (+ alloc_or_die_master_~ptr~1.offset 8))) (and (<= (+ |c_#StackHeapBarrier| 1) alloc_or_die_master_~ptr~1.base) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0))) (= (store |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0)) |c_#memory_$Pointer$.offset|)))) is different from true [2019-10-02 02:04:35,735 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-02 02:04:35,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:35,923 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2019-10-02 02:04:35,924 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:36,002 INFO L567 ElimStorePlain]: treesize reduction 17, result has 80.7 percent of original size [2019-10-02 02:04:36,014 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 71 [2019-10-02 02:04:36,015 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:36,107 INFO L567 ElimStorePlain]: treesize reduction 19, result has 80.2 percent of original size [2019-10-02 02:04:36,108 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,110 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,111 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:36,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:65, output treesize:1 [2019-10-02 02:04:36,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:04:36,534 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 02:04:36,534 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:36,538 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:04:36,538 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:36,539 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:36,540 INFO L464 ElimStorePlain]: Eliminatee |v_old(#memory_$Pointer$.offset)_AFTER_CALL_75| vanished before elimination [2019-10-02 02:04:36,540 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:36,540 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:99, output treesize:1 [2019-10-02 02:04:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 02:04:36,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:04:36,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2019-10-02 02:04:36,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 02:04:36,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 02:04:36,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=4, NotChecked=34, Total=380 [2019-10-02 02:04:36,598 INFO L87 Difference]: Start difference. First operand 202 states and 239 transitions. Second operand 20 states. [2019-10-02 02:04:54,125 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2019-10-02 02:04:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:04:56,976 INFO L93 Difference]: Finished difference Result 402 states and 478 transitions. [2019-10-02 02:04:56,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 02:04:56,977 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 157 [2019-10-02 02:04:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:04:56,980 INFO L225 Difference]: With dead ends: 402 [2019-10-02 02:04:56,980 INFO L226 Difference]: Without dead ends: 211 [2019-10-02 02:04:56,981 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 151 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=75, Invalid=425, Unknown=10, NotChecked=42, Total=552 [2019-10-02 02:04:56,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-02 02:04:56,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 208. [2019-10-02 02:04:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-02 02:04:56,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 247 transitions. [2019-10-02 02:04:56,995 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 247 transitions. Word has length 157 [2019-10-02 02:04:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:04:56,996 INFO L475 AbstractCegarLoop]: Abstraction has 208 states and 247 transitions. [2019-10-02 02:04:56,996 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-02 02:04:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 247 transitions. [2019-10-02 02:04:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 02:04:56,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:04:56,999 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 02:04:56,999 INFO L418 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:04:56,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:04:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1632845278, now seen corresponding path program 1 times [2019-10-02 02:04:56,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:04:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:04:57,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:57,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:04:57,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:04:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 33 proven. 27 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-10-02 02:04:57,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:04:57,474 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:04:57,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:04:57,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:04:57,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 60 conjunts are in the unsatisfiable core [2019-10-02 02:04:57,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:04:57,764 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:57,764 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2019-10-02 02:04:57,765 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:57,797 INFO L567 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-10-02 02:04:57,798 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:57,798 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2019-10-02 02:04:57,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-02 02:04:57,834 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:04:57,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:04:57,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:04:57,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-02 02:04:59,891 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ |c_#StackHeapBarrier| 1) alloc_or_die_master_~ptr~1.base) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0))))) is different from true [2019-10-02 02:05:13,890 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-10-02 02:05:16,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:05:16,332 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-02 02:05:16,332 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:05:16,333 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:05:16,333 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:05:16,334 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:1 [2019-10-02 02:05:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 33 proven. 25 refuted. 0 times theorem prover too weak. 120 trivial. 2 not checked. [2019-10-02 02:05:16,359 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 02:05:16,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 30 [2019-10-02 02:05:16,360 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-02 02:05:16,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-02 02:05:16,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=725, Unknown=7, NotChecked=54, Total=870 [2019-10-02 02:05:16,361 INFO L87 Difference]: Start difference. First operand 208 states and 247 transitions. Second operand 30 states. [2019-10-02 02:05:22,624 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2019-10-02 02:05:24,696 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2019-10-02 02:05:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 02:05:28,479 INFO L93 Difference]: Finished difference Result 410 states and 488 transitions. [2019-10-02 02:05:28,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-02 02:05:28,480 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 157 [2019-10-02 02:05:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 02:05:28,483 INFO L225 Difference]: With dead ends: 410 [2019-10-02 02:05:28,483 INFO L226 Difference]: Without dead ends: 214 [2019-10-02 02:05:28,486 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=186, Invalid=1616, Unknown=8, NotChecked=82, Total=1892 [2019-10-02 02:05:28,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-10-02 02:05:28,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2019-10-02 02:05:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2019-10-02 02:05:28,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2019-10-02 02:05:28,500 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 157 [2019-10-02 02:05:28,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 02:05:28,501 INFO L475 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2019-10-02 02:05:28,501 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-02 02:05:28,501 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2019-10-02 02:05:28,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 02:05:28,503 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 02:05:28,503 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 02:05:28,504 INFO L418 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 02:05:28,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 02:05:28,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1709746076, now seen corresponding path program 1 times [2019-10-02 02:05:28,504 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 02:05:28,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 02:05:28,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:05:28,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:05:28,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 02:05:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:05:44,283 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2019-10-02 02:05:44,450 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-10-02 02:05:45,899 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2019-10-02 02:05:46,592 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-10-02 02:05:47,035 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 46 [2019-10-02 02:05:47,794 WARN L191 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-10-02 02:05:48,663 WARN L191 SmtUtils]: Spent 523.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-10-02 02:05:50,492 WARN L191 SmtUtils]: Spent 776.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2019-10-02 02:05:52,220 WARN L191 SmtUtils]: Spent 755.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 71 [2019-10-02 02:05:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 121 proven. 33 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 02:05:57,958 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 02:05:57,958 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:05:58,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 02:05:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 02:05:58,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 268 conjunts are in the unsatisfiable core [2019-10-02 02:05:58,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 02:05:59,143 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:05:59,143 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-10-02 02:05:59,144 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:05:59,182 INFO L567 ElimStorePlain]: treesize reduction 16, result has 77.1 percent of original size [2019-10-02 02:05:59,205 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:05:59,206 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-10-02 02:05:59,206 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:05:59,254 INFO L567 ElimStorePlain]: treesize reduction 16, result has 75.4 percent of original size [2019-10-02 02:05:59,255 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:05:59,255 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:59, output treesize:16 [2019-10-02 02:05:59,857 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-02 02:05:59,858 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:05:59,865 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:05:59,869 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2019-10-02 02:05:59,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:05:59,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:05:59,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:05:59,877 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:7 [2019-10-02 02:06:00,035 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-10-02 02:06:00,036 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:06:00,047 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:06:00,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:06:00,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-10-02 02:06:01,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-10-02 02:06:01,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:06:01,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:06:01,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:06:01,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:7 [2019-10-02 02:06:03,252 WARN L191 SmtUtils]: Spent 725.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2019-10-02 02:06:03,267 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 11 treesize of output 7 [2019-10-02 02:06:03,267 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:06:03,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:06:03,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 02:06:03,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2019-10-02 02:06:03,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:06:03,913 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-10-02 02:06:03,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:06:03,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:06:03,927 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-10-02 02:06:03,928 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:06:03,937 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:06:03,938 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 02:06:03,938 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:30, output treesize:7 [2019-10-02 02:06:05,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:06:07,133 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse3 (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base))) (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse3 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (not (= dll_insert_slave_~item~0.base 0)) (< |c_#StackHeapBarrier| dll_insert_slave_~item~0.base) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse3 0 .cse2)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) 4) dll_insert_slave_~item~0.base))))) (store .cse0 |c_dll_insert_slave_#in~dll.base| (store (select .cse0 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| dll_insert_slave_~item~0.base)))) (not (= 0 .cse2)))))) (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse7 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (not (= dll_insert_slave_~item~0.base 0)) (< |c_#StackHeapBarrier| dll_insert_slave_~item~0.base) (= |c_#memory_$Pointer$.base| (let ((.cse4 (let ((.cse8 (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base))) (let ((.cse6 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse8 0 .cse6)))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ .cse7 4) dll_insert_slave_~item~0.base))))))) (store .cse4 |c_dll_insert_slave_#in~dll.base| (store (select .cse4 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| dll_insert_slave_~item~0.base)))) (not (= .cse7 0)))))) is different from true [2019-10-02 02:06:09,170 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_slave_~item~0.base Int)) (let ((.cse3 (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base))) (let ((.cse2 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse3 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (not (= dll_insert_slave_~item~0.base 0)) (< |c_#StackHeapBarrier| dll_insert_slave_~item~0.base) (= |c_#memory_$Pointer$.base| (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store .cse3 0 .cse2)))) (store .cse1 .cse2 (store (select .cse1 .cse2) (+ (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_slave_~item~0.base) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) 4) dll_insert_slave_~item~0.base))))) (store .cse0 |c_dll_insert_slave_#in~dll.base| (store (select .cse0 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| dll_insert_slave_~item~0.base)))) (not (= 0 .cse2)))))) (exists ((v_prenex_13 Int)) (let ((.cse7 (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_13 (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_13) 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (and (not (= v_prenex_13 0)) (= |c_#memory_$Pointer$.base| (let ((.cse4 (let ((.cse8 (select |c_old(#memory_$Pointer$.base)| v_prenex_13))) (let ((.cse6 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_13 (store .cse8 0 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|))) (let ((.cse5 (store |c_old(#memory_$Pointer$.base)| v_prenex_13 (store .cse8 0 .cse6)))) (store .cse5 .cse6 (store (select .cse5 .cse6) (+ .cse7 4) v_prenex_13))))))) (store .cse4 |c_dll_insert_slave_#in~dll.base| (store (select .cse4 |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset| v_prenex_13)))) (< |c_#StackHeapBarrier| v_prenex_13) (not (= .cse7 0)))))) is different from true [2019-10-02 02:08:22,403 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 65 [2019-10-02 02:08:22,407 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:08:22,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:22,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:22,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:08:22,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 841 treesize of output 829 [2019-10-02 02:08:22,433 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 02:08:22,480 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:08:22,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-02 02:08:22,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:1667, output treesize:822 [2019-10-02 02:09:38,415 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-02 02:09:38,445 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,445 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 15 [2019-10-02 02:09:38,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:38,699 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-10-02 02:09:38,699 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:38,700 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:38,701 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:14785, output treesize:14776 [2019-10-02 02:09:48,576 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-02 02:09:48,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 02:09:48,671 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2019-10-02 02:09:48,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 02:09:49,389 WARN L191 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 87 [2019-10-02 02:09:49,390 INFO L567 ElimStorePlain]: treesize reduction 16, result has 100.0 percent of original size [2019-10-02 02:09:49,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:09:49,393 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-10-02 02:09:49,393 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:55587, output treesize:78935 [2019-10-02 02:10:27,566 WARN L191 SmtUtils]: Spent 18.79 s on a formula simplification that was a NOOP. DAG size: 142 [2019-10-02 02:11:03,858 WARN L191 SmtUtils]: Spent 18.72 s on a formula simplification that was a NOOP. DAG size: 142 [2019-10-02 02:11:38,641 WARN L191 SmtUtils]: Spent 18.51 s on a formula simplification that was a NOOP. DAG size: 142 [2019-10-02 02:11:38,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 02:11:38,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 02:11:38,874 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: incompatible size at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.computeCostEstimation(ArrayIndexBasedCostEstimation.java:152) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.(ArrayIndexBasedCostEstimation.java:64) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.computeCostEstimation(ElimStorePlain.java:519) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:390) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) 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-10-02 02:11:38,879 INFO L168 Benchmark]: Toolchain (without parser) took 470184.56 ms. Allocated memory was 133.7 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 81.9 MB in the beginning and 612.7 MB in the end (delta: -530.8 MB). Peak memory consumption was 724.4 MB. Max. memory is 7.1 GB. [2019-10-02 02:11:38,880 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 133.7 MB. Free memory was 102.2 MB in the beginning and 102.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 02:11:38,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 765.99 ms. Allocated memory was 133.7 MB in the beginning and 196.6 MB in the end (delta: 62.9 MB). Free memory was 81.7 MB in the beginning and 154.4 MB in the end (delta: -72.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-10-02 02:11:38,881 INFO L168 Benchmark]: Boogie Preprocessor took 115.85 ms. Allocated memory is still 196.6 MB. Free memory was 154.4 MB in the beginning and 149.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. [2019-10-02 02:11:38,882 INFO L168 Benchmark]: RCFGBuilder took 917.65 ms. Allocated memory is still 196.6 MB. Free memory was 149.9 MB in the beginning and 75.9 MB in the end (delta: 73.9 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. [2019-10-02 02:11:38,884 INFO L168 Benchmark]: TraceAbstraction took 468374.52 ms. Allocated memory was 196.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 75.9 MB in the beginning and 612.7 MB in the end (delta: -536.8 MB). Peak memory consumption was 655.5 MB. Max. memory is 7.1 GB. [2019-10-02 02:11:38,887 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 133.7 MB. Free memory was 102.2 MB in the beginning and 102.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 765.99 ms. Allocated memory was 133.7 MB in the beginning and 196.6 MB in the end (delta: 62.9 MB). Free memory was 81.7 MB in the beginning and 154.4 MB in the end (delta: -72.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 115.85 ms. Allocated memory is still 196.6 MB. Free memory was 154.4 MB in the beginning and 149.9 MB in the end (delta: 4.5 MB). Peak memory consumption was 4.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 917.65 ms. Allocated memory is still 196.6 MB. Free memory was 149.9 MB in the beginning and 75.9 MB in the end (delta: 73.9 MB). Peak memory consumption was 73.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 468374.52 ms. Allocated memory was 196.6 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 75.9 MB in the beginning and 612.7 MB in the end (delta: -536.8 MB). Peak memory consumption was 655.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: incompatible size de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: incompatible size: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayIndexBasedCostEstimation.analyzeCosts(ArrayIndexBasedCostEstimation.java:211) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...