/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:30:46,685 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:30:46,688 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:30:46,708 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:30:46,708 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:30:46,710 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:30:46,711 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:30:46,721 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:30:46,725 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:30:46,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:30:46,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:30:46,733 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:30:46,733 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:30:46,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:30:46,738 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:30:46,740 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:30:46,742 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:30:46,743 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:30:46,744 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:30:46,749 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:30:46,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:30:46,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:30:46,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:30:46,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:30:46,763 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:30:46,763 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:30:46,763 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:30:46,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:30:46,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:30:46,767 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:30:46,767 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:30:46,768 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:30:46,769 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:30:46,770 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:30:46,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:30:46,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:30:46,773 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:30:46,773 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:30:46,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:30:46,774 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:30:46,775 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:30:46,776 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-11-07 00:30:46,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:30:46,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:30:46,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:30:46,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:30:46,808 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:30:46,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:30:46,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:30:46,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:30:46,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:30:46,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:30:46,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:30:46,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:30:46,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:30:46,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:30:46,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:30:46,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:30:46,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:30:46,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:30:46,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:30:46,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:30:46,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:30:46,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:30:46,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:30:46,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:30:46,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:30:46,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:30:46,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:30:46,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:30:46,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:30:47,097 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:30:47,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:30:47,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:30:47,121 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:30:47,122 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:30:47,123 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-07 00:30:47,202 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce5281d9/5a158d5148e64fc0901f1df81d5cb484/FLAGbe69e5a6c [2019-11-07 00:30:47,802 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:30:47,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr-2.i [2019-11-07 00:30:47,828 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce5281d9/5a158d5148e64fc0901f1df81d5cb484/FLAGbe69e5a6c [2019-11-07 00:30:48,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ce5281d9/5a158d5148e64fc0901f1df81d5cb484 [2019-11-07 00:30:48,068 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:30:48,070 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:30:48,072 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:30:48,072 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:30:48,076 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:30:48,077 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d931765 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48, skipping insertion in model container [2019-11-07 00:30:48,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,086 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:30:48,147 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:30:48,540 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:30:48,552 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:30:48,603 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:30:48,665 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:30:48,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48 WrapperNode [2019-11-07 00:30:48,665 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:30:48,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:30:48,666 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:30:48,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:30:48,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,697 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,698 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,740 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (1/1) ... [2019-11-07 00:30:48,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:30:48,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:30:48,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:30:48,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:30:48,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (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-11-07 00:30:48,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:30:48,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:30:48,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-07 00:30:48,814 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-07 00:30:48,814 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-07 00:30:48,814 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:30:48,814 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:30:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 00:30:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-07 00:30:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-07 00:30:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-07 00:30:48,815 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-07 00:30:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-07 00:30:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-07 00:30:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-07 00:30:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-07 00:30:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-07 00:30:48,816 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-07 00:30:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-07 00:30:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-07 00:30:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-07 00:30:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-07 00:30:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-07 00:30:48,817 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-07 00:30:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-07 00:30:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-07 00:30:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-07 00:30:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-07 00:30:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-07 00:30:48,818 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-07 00:30:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-07 00:30:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-07 00:30:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-07 00:30:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-07 00:30:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-07 00:30:48,819 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-07 00:30:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-07 00:30:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-07 00:30:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-07 00:30:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-07 00:30:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-07 00:30:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-07 00:30:48,820 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-07 00:30:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-07 00:30:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-07 00:30:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-07 00:30:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-07 00:30:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-07 00:30:48,821 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-07 00:30:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-07 00:30:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-07 00:30:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-07 00:30:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-07 00:30:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-07 00:30:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-07 00:30:48,822 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-07 00:30:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-07 00:30:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-07 00:30:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-07 00:30:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-07 00:30:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-07 00:30:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-07 00:30:48,823 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-07 00:30:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-07 00:30:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-07 00:30:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-07 00:30:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-07 00:30:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-07 00:30:48,824 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-07 00:30:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-07 00:30:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-07 00:30:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-07 00:30:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-07 00:30:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-07 00:30:48,825 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-07 00:30:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-07 00:30:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-07 00:30:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-07 00:30:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-07 00:30:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-07 00:30:48,826 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-07 00:30:48,827 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-07 00:30:48,827 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-07 00:30:48,827 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-07 00:30:48,827 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-07 00:30:48,827 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-07 00:30:48,827 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-07 00:30:48,827 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-07 00:30:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-07 00:30:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-07 00:30:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-07 00:30:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-07 00:30:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-07 00:30:48,828 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-07 00:30:48,829 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-07 00:30:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-07 00:30:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-07 00:30:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-07 00:30:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-07 00:30:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-07 00:30:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-07 00:30:48,830 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-07 00:30:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-07 00:30:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-07 00:30:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-07 00:30:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-07 00:30:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-07 00:30:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:30:48,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-07 00:30:48,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-07 00:30:48,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-07 00:30:48,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:30:48,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:30:48,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:30:48,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:30:48,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:30:49,194 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-07 00:30:49,556 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:30:49,556 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-07 00:30:49,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:30:49 BoogieIcfgContainer [2019-11-07 00:30:49,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:30:49,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:30:49,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:30:49,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:30:49,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:30:48" (1/3) ... [2019-11-07 00:30:49,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34667ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:30:49, skipping insertion in model container [2019-11-07 00:30:49,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:30:48" (2/3) ... [2019-11-07 00:30:49,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34667ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:30:49, skipping insertion in model container [2019-11-07 00:30:49,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:30:49" (3/3) ... [2019-11-07 00:30:49,567 INFO L109 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr-2.i [2019-11-07 00:30:49,577 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:30:49,585 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:30:49,597 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:30:49,627 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:30:49,627 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:30:49,627 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:30:49,628 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:30:49,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:30:49,628 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:30:49,628 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:30:49,629 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:30:49,648 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states. [2019-11-07 00:30:49,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 00:30:49,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:30:49,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:30:49,658 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:30:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:49,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1575706012, now seen corresponding path program 1 times [2019-11-07 00:30:49,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:30:49,675 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224856706] [2019-11-07 00:30:49,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:30:49,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:49,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:30:49,838 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224856706] [2019-11-07 00:30:49,841 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:30:49,841 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:30:49,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234647003] [2019-11-07 00:30:49,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:30:49,850 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:30:49,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:30:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:30:49,869 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 2 states. [2019-11-07 00:30:49,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:30:49,918 INFO L93 Difference]: Finished difference Result 108 states and 166 transitions. [2019-11-07 00:30:49,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:30:49,919 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2019-11-07 00:30:49,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:30:49,928 INFO L225 Difference]: With dead ends: 108 [2019-11-07 00:30:49,929 INFO L226 Difference]: Without dead ends: 47 [2019-11-07 00:30:49,932 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:30:49,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-07 00:30:49,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-07 00:30:49,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-07 00:30:49,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 64 transitions. [2019-11-07 00:30:49,979 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 64 transitions. Word has length 20 [2019-11-07 00:30:49,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:30:49,979 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 64 transitions. [2019-11-07 00:30:49,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:30:49,980 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 64 transitions. [2019-11-07 00:30:49,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-07 00:30:49,981 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:30:49,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:30:49,982 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:30:49,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:49,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1627887593, now seen corresponding path program 1 times [2019-11-07 00:30:49,982 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:30:49,983 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279084455] [2019-11-07 00:30:49,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:30:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:50,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:30:50,052 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279084455] [2019-11-07 00:30:50,052 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:30:50,052 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:30:50,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707819832] [2019-11-07 00:30:50,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:30:50,055 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:30:50,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:30:50,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:30:50,056 INFO L87 Difference]: Start difference. First operand 47 states and 64 transitions. Second operand 3 states. [2019-11-07 00:30:50,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:30:50,085 INFO L93 Difference]: Finished difference Result 75 states and 101 transitions. [2019-11-07 00:30:50,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:30:50,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-07 00:30:50,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:30:50,092 INFO L225 Difference]: With dead ends: 75 [2019-11-07 00:30:50,093 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 00:30:50,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:30:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 00:30:50,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-11-07 00:30:50,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-11-07 00:30:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2019-11-07 00:30:50,103 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 25 [2019-11-07 00:30:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:30:50,104 INFO L462 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2019-11-07 00:30:50,104 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:30:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2019-11-07 00:30:50,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:30:50,105 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:30:50,105 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:30:50,106 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:30:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash -164754602, now seen corresponding path program 1 times [2019-11-07 00:30:50,106 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:30:50,107 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053967729] [2019-11-07 00:30:50,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:30:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:30:50,192 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053967729] [2019-11-07 00:30:50,192 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:30:50,192 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:30:50,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022018848] [2019-11-07 00:30:50,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:30:50,193 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:30:50,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:30:50,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:30:50,194 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand 3 states. [2019-11-07 00:30:50,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:30:50,221 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2019-11-07 00:30:50,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:30:50,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-07 00:30:50,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:30:50,223 INFO L225 Difference]: With dead ends: 93 [2019-11-07 00:30:50,223 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 00:30:50,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:30:50,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 00:30:50,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2019-11-07 00:30:50,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-11-07 00:30:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2019-11-07 00:30:50,232 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 31 [2019-11-07 00:30:50,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:30:50,232 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2019-11-07 00:30:50,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:30:50,232 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2019-11-07 00:30:50,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-07 00:30:50,233 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:30:50,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:30:50,234 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:30:50,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:50,234 INFO L82 PathProgramCache]: Analyzing trace with hash -982403052, now seen corresponding path program 1 times [2019-11-07 00:30:50,234 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:30:50,235 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266247147] [2019-11-07 00:30:50,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:30:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:30:50,348 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266247147] [2019-11-07 00:30:50,348 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:30:50,349 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:30:50,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608268216] [2019-11-07 00:30:50,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:30:50,350 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:30:50,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:30:50,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:30:50,350 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand 5 states. [2019-11-07 00:30:50,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:30:50,520 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2019-11-07 00:30:50,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:30:50,521 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-11-07 00:30:50,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:30:50,522 INFO L225 Difference]: With dead ends: 82 [2019-11-07 00:30:50,522 INFO L226 Difference]: Without dead ends: 78 [2019-11-07 00:30:50,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:30:50,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-07 00:30:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2019-11-07 00:30:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-07 00:30:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2019-11-07 00:30:50,531 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 31 [2019-11-07 00:30:50,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:30:50,532 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2019-11-07 00:30:50,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:30:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2019-11-07 00:30:50,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:30:50,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:30:50,533 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:30:50,534 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:30:50,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:50,534 INFO L82 PathProgramCache]: Analyzing trace with hash 852152367, now seen corresponding path program 1 times [2019-11-07 00:30:50,534 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:30:50,535 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187851173] [2019-11-07 00:30:50,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:30:50,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:50,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:30:50,621 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187851173] [2019-11-07 00:30:50,622 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:30:50,622 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:30:50,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733140146] [2019-11-07 00:30:50,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:30:50,623 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:30:50,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:30:50,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:30:50,624 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 5 states. [2019-11-07 00:30:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:30:50,771 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2019-11-07 00:30:50,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:30:50,772 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-07 00:30:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:30:50,773 INFO L225 Difference]: With dead ends: 84 [2019-11-07 00:30:50,773 INFO L226 Difference]: Without dead ends: 76 [2019-11-07 00:30:50,774 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:30:50,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-07 00:30:50,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 64. [2019-11-07 00:30:50,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2019-11-07 00:30:50,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 88 transitions. [2019-11-07 00:30:50,781 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 88 transitions. Word has length 33 [2019-11-07 00:30:50,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:30:50,782 INFO L462 AbstractCegarLoop]: Abstraction has 64 states and 88 transitions. [2019-11-07 00:30:50,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:30:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 88 transitions. [2019-11-07 00:30:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-07 00:30:50,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:30:50,783 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:30:50,784 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:30:50,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:50,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1876855343, now seen corresponding path program 1 times [2019-11-07 00:30:50,784 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:30:50,785 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437108624] [2019-11-07 00:30:50,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:30:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:50,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:30:50,876 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437108624] [2019-11-07 00:30:50,877 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:30:50,877 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 00:30:50,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536432211] [2019-11-07 00:30:50,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 00:30:50,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:30:50,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 00:30:50,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:30:50,879 INFO L87 Difference]: Start difference. First operand 64 states and 88 transitions. Second operand 5 states. [2019-11-07 00:30:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:30:50,980 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2019-11-07 00:30:50,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 00:30:50,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-11-07 00:30:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:30:50,982 INFO L225 Difference]: With dead ends: 84 [2019-11-07 00:30:50,983 INFO L226 Difference]: Without dead ends: 73 [2019-11-07 00:30:50,983 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-07 00:30:50,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-07 00:30:50,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2019-11-07 00:30:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-11-07 00:30:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 84 transitions. [2019-11-07 00:30:50,990 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 84 transitions. Word has length 33 [2019-11-07 00:30:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:30:50,990 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 84 transitions. [2019-11-07 00:30:50,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 00:30:50,991 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2019-11-07 00:30:50,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-07 00:30:50,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:30:50,992 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:30:50,992 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:30:50,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:50,993 INFO L82 PathProgramCache]: Analyzing trace with hash -778946181, now seen corresponding path program 1 times [2019-11-07 00:30:50,993 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:30:50,993 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610992003] [2019-11-07 00:30:50,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:30:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:51,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:30:51,199 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610992003] [2019-11-07 00:30:51,200 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098993711] [2019-11-07 00:30:51,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:30:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:30:51,375 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-07 00:30:51,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:30:51,443 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-11-07 00:30:51,443 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,457 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-07 00:30:51,485 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,486 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-07 00:30:51,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,500 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,506 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-11-07 00:30:51,506 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,516 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,516 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2019-11-07 00:30:51,536 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-07 00:30:51,536 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 11 [2019-11-07 00:30:51,537 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,543 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,543 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:12 [2019-11-07 00:30:51,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-11-07 00:30:51,568 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,577 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-11-07 00:30:51,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2019-11-07 00:30:51,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-07 00:30:51,618 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,622 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,623 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,623 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2019-11-07 00:30:51,629 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:30:51,630 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:30:51,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:30:51,679 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-07 00:30:51,682 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,687 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:30:51,688 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-07 00:30:51,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:54, output treesize:22 [2019-11-07 00:30:51,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:30:51,737 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 170 treesize of output 162 [2019-11-07 00:30:51,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-07 00:30:51,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:30:51,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:30:51,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:30:51,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:30:51,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:30:51,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:30:51,912 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-11-07 00:30:51,912 INFO L567 ElimStorePlain]: treesize reduction 303, result has 10.1 percent of original size [2019-11-07 00:30:51,914 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-07 00:30:51,914 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-07 00:30:52,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:30:52,032 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [591626248] [2019-11-07 00:30:52,038 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 36 [2019-11-07 00:30:52,088 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:30:52,088 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:30:52,157 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-07 00:30:52,159 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 47 variables. [2019-11-07 00:30:52,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:30:52,163 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-07 00:30:52,196 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-07 00:30:52,196 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-07 00:30:52,198 INFO L553 sIntCurrentIteration]: We unified 34 AI predicates to 34 [2019-11-07 00:30:52,198 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-07 00:30:52,198 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:30:52,198 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8, 8, 8] total 13 [2019-11-07 00:30:52,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967696747] [2019-11-07 00:30:52,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:30:52,200 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:30:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:30:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:30:52,200 INFO L87 Difference]: Start difference. First operand 61 states and 84 transitions. Second operand 2 states. [2019-11-07 00:30:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:30:52,202 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2019-11-07 00:30:52,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:30:52,202 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 35 [2019-11-07 00:30:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:30:52,202 INFO L225 Difference]: With dead ends: 61 [2019-11-07 00:30:52,202 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:30:52,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 5 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-11-07 00:30:52,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:30:52,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:30:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:30:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:30:52,204 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-07 00:30:52,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:30:52,204 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:30:52,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:30:52,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:30:52,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:30:52,410 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:30:52,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:30:52,457 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:30:52,457 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:30:52,457 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:30:52,457 INFO L446 ceAbstractionStarter]: At program point myexitENTRY(lines 529 531) the Hoare annotation is: true [2019-11-07 00:30:52,457 INFO L443 ceAbstractionStarter]: For program point myexitEXIT(lines 529 531) no Hoare annotation was computed. [2019-11-07 00:30:52,457 INFO L446 ceAbstractionStarter]: At program point L530(line 530) the Hoare annotation is: true [2019-11-07 00:30:52,457 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 175 179) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 175 179) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 175 179) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 180 184) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 180 184) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 180 184) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:30:52,458 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L439 ceAbstractionStarter]: At program point L547-2(lines 546 551) the Hoare annotation is: false [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 536 611) no Hoare annotation was computed. [2019-11-07 00:30:52,458 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 607) no Hoare annotation was computed. [2019-11-07 00:30:52,459 INFO L443 ceAbstractionStarter]: For program point L606-2(lines 536 611) no Hoare annotation was computed. [2019-11-07 00:30:52,459 INFO L443 ceAbstractionStarter]: For program point L606-3(lines 606 607) no Hoare annotation was computed. [2019-11-07 00:30:52,459 INFO L443 ceAbstractionStarter]: For program point L598(line 598) no Hoare annotation was computed. [2019-11-07 00:30:52,459 INFO L446 ceAbstractionStarter]: At program point L598-1(line 598) the Hoare annotation is: true [2019-11-07 00:30:52,459 INFO L439 ceAbstractionStarter]: At program point L565-2(lines 565 583) the Hoare annotation is: false [2019-11-07 00:30:52,459 INFO L443 ceAbstractionStarter]: For program point L598-3(line 598) no Hoare annotation was computed. [2019-11-07 00:30:52,459 INFO L443 ceAbstractionStarter]: For program point L565-3(lines 565 583) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L557-2(lines 557 561) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L439 ceAbstractionStarter]: At program point L557-4(lines 544 562) the Hoare annotation is: false [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L446 ceAbstractionStarter]: At program point L591-1(line 591) the Hoare annotation is: true [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 536 611) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L591-3(line 591) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L608(lines 608 609) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L608-2(lines 608 609) no Hoare annotation was computed. [2019-11-07 00:30:52,460 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 536 611) the Hoare annotation is: true [2019-11-07 00:30:52,460 INFO L443 ceAbstractionStarter]: For program point L609(line 609) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 579) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L568-1(line 568) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L568-3(lines 568 574) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L568-5(lines 565 583) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L585(line 585) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L446 ceAbstractionStarter]: At program point L585-1(line 585) the Hoare annotation is: true [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L552-2(lines 552 556) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L585-3(line 585) no Hoare annotation was computed. [2019-11-07 00:30:52,461 INFO L443 ceAbstractionStarter]: For program point L552-4(lines 552 556) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 544 562) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L544-3(lines 544 562) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 609) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L570(lines 570 573) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L439 ceAbstractionStarter]: At program point L570-2(lines 568 574) the Hoare annotation is: false [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 601) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 536 611) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L595-3(lines 595 601) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L546-1(line 546) no Hoare annotation was computed. [2019-11-07 00:30:52,462 INFO L443 ceAbstractionStarter]: For program point L546-3(lines 546 551) no Hoare annotation was computed. [2019-11-07 00:30:52,463 INFO L443 ceAbstractionStarter]: For program point L546-5(lines 546 551) no Hoare annotation was computed. [2019-11-07 00:30:52,463 INFO L443 ceAbstractionStarter]: For program point L604-1(lines 604 605) no Hoare annotation was computed. [2019-11-07 00:30:52,463 INFO L439 ceAbstractionStarter]: At program point L604-3(lines 604 605) the Hoare annotation is: (and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset) (= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))) [2019-11-07 00:30:52,463 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 588 594) no Hoare annotation was computed. [2019-11-07 00:30:52,463 INFO L439 ceAbstractionStarter]: At program point L588-3(lines 588 594) the Hoare annotation is: false [2019-11-07 00:30:52,463 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 550) no Hoare annotation was computed. [2019-11-07 00:30:52,474 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-07 00:30:52,476 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-07 00:30:52,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:30:52 BoogieIcfgContainer [2019-11-07 00:30:52,479 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:30:52,480 INFO L168 Benchmark]: Toolchain (without parser) took 4410.52 ms. Allocated memory was 146.3 MB in the beginning and 246.4 MB in the end (delta: 100.1 MB). Free memory was 103.1 MB in the beginning and 106.4 MB in the end (delta: -3.3 MB). Peak memory consumption was 96.9 MB. Max. memory is 7.1 GB. [2019-11-07 00:30:52,481 INFO L168 Benchmark]: CDTParser took 1.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:30:52,482 INFO L168 Benchmark]: CACSL2BoogieTranslator took 594.23 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.9 MB in the beginning and 169.8 MB in the end (delta: -66.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-11-07 00:30:52,483 INFO L168 Benchmark]: Boogie Preprocessor took 81.37 ms. Allocated memory is still 204.5 MB. Free memory was 169.8 MB in the beginning and 166.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-11-07 00:30:52,486 INFO L168 Benchmark]: RCFGBuilder took 810.28 ms. Allocated memory is still 204.5 MB. Free memory was 166.6 MB in the beginning and 110.5 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. [2019-11-07 00:30:52,487 INFO L168 Benchmark]: TraceAbstraction took 2919.38 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 109.9 MB in the beginning and 106.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:30:52,494 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.49 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 594.23 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.9 MB in the beginning and 169.8 MB in the end (delta: -66.9 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 81.37 ms. Allocated memory is still 204.5 MB. Free memory was 169.8 MB in the beginning and 166.6 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 810.28 ms. Allocated memory is still 204.5 MB. Free memory was 166.6 MB in the beginning and 110.5 MB in the end (delta: 56.1 MB). Peak memory consumption was 56.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2919.38 ms. Allocated memory was 204.5 MB in the beginning and 246.4 MB in the end (delta: 41.9 MB). Free memory was 109.9 MB in the beginning and 106.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 45.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 609]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 530]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 546]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 604]: Loop Invariant [2019-11-07 00:30:52,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-07 00:30:52,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (a == p && a == p) && 3 == unknown-#memory_int-unknown[p][p] - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 565]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 544]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 588]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Result: SAFE, OverallTime: 2.8s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 377 SDtfs, 75 SDslu, 566 SDs, 0 SdLazy, 167 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 36 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 25 PreInvPairs, 29 NumberOfFragments, 28 HoareAnnotationTreeSize, 25 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 269 ConstructedInterpolants, 9 QuantifiedInterpolants, 30897 SizeOfPredicates, 14 NumberOfNonLiveVariables, 157 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 11/17 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 126, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9558823529411765, AVG_VARS_REMOVED_DURING_WEAKENING: 1.2941176470588236, AVG_WEAKENED_CONJUNCTS: 0.17647058823529413, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...