java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:37:29,714 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:37:29,716 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:37:29,733 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:37:29,733 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:37:29,734 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:37:29,735 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:37:29,737 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:37:29,738 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:37:29,739 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:37:29,739 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:37:29,740 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:37:29,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:37:29,741 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:37:29,742 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:37:29,744 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:37:29,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:37:29,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:37:29,750 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:37:29,751 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:37:29,753 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:37:29,754 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:37:29,754 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:37:29,755 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:37:29,756 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:37:29,757 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:37:29,757 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:37:29,758 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:37:29,758 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:37:29,758 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:37:29,759 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:37:29,759 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-21 08:37:29,769 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:37:29,769 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:37:29,770 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:37:29,770 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:37:29,771 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:37:29,771 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:37:29,771 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:37:29,771 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:37:29,771 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:37:29,772 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:37:29,772 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:37:29,773 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:37:29,773 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:37:29,773 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:37:29,773 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:37:29,773 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:37:29,774 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:37:29,774 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:37:29,774 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:37:29,774 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:37:29,774 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:37:29,775 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:37:29,775 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:37:29,775 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:37:29,775 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:37:29,775 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:37:29,775 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:37:29,776 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:37:29,776 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:37:29,776 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:37:29,776 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:37:29,776 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:37:29,776 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:37:29,777 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:37:29,777 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:37:29,777 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:37:29,777 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:37:29,777 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:37:29,778 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:37:29,778 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:37:29,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:37:29,826 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:37:29,831 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:37:29,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:37:29,833 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:37:29,834 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_false-unreach-call_false-valid-deref.i [2018-01-21 08:37:30,031 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:37:30,034 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:37:30,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:37:30,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:37:30,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:37:30,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6479bd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30, skipping insertion in model container [2018-01-21 08:37:30,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,058 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:37:30,096 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:37:30,219 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:37:30,241 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:37:30,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30 WrapperNode [2018-01-21 08:37:30,251 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:37:30,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:37:30,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:37:30,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:37:30,269 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,285 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,289 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,290 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... [2018-01-21 08:37:30,293 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:37:30,293 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:37:30,294 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:37:30,294 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:37:30,295 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (1/1) ... No working directory specified, using /storage/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 [2018-01-21 08:37:30,344 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:37:30,345 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:37:30,345 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 08:37:30,345 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:37:30,345 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 08:37:30,345 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 08:37:30,345 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 08:37:30,345 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 08:37:30,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:37:30,345 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:37:30,345 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:37:30,346 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:37:30,597 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:37:30,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:37:30 BoogieIcfgContainer [2018-01-21 08:37:30,597 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:37:30,598 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:37:30,598 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:37:30,600 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:37:30,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:37:30" (1/3) ... [2018-01-21 08:37:30,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3157d22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:37:30, skipping insertion in model container [2018-01-21 08:37:30,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:37:30" (2/3) ... [2018-01-21 08:37:30,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3157d22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:37:30, skipping insertion in model container [2018-01-21 08:37:30,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:37:30" (3/3) ... [2018-01-21 08:37:30,603 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_flag_false-unreach-call_false-valid-deref.i [2018-01-21 08:37:30,609 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:37:30,616 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 08:37:30,653 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:30,653 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:30,654 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:30,654 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:30,654 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:30,654 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:30,654 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:30,654 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 08:37:30,655 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:30,674 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:37:30,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:37:30,689 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 62 states. [2018-01-21 08:37:30,787 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 08:37:30,787 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 08:37:30,788 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 08:37:30,788 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 08:37:30,788 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 08:37:30,788 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 670) no Hoare annotation was computed. [2018-01-21 08:37:30,788 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 670) no Hoare annotation was computed. [2018-01-21 08:37:30,789 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 670) the Hoare annotation is: true [2018-01-21 08:37:30,789 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 670) no Hoare annotation was computed. [2018-01-21 08:37:30,789 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 670) the Hoare annotation is: true [2018-01-21 08:37:30,789 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 670) no Hoare annotation was computed. [2018-01-21 08:37:30,789 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 670) the Hoare annotation is: true [2018-01-21 08:37:30,789 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 670) no Hoare annotation was computed. [2018-01-21 08:37:30,789 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 670) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point L662''''(lines 662 666) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point L662'(line 662) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point L649'''(lines 649 655) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 08:37:30,790 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 627 670) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L648'(line 648) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L664'(line 664) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 658) no Hoare annotation was computed. [2018-01-21 08:37:30,791 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 08:37:30,792 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-21 08:37:30,792 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-21 08:37:30,792 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 627 670) no Hoare annotation was computed. [2018-01-21 08:37:30,792 INFO L401 ceAbstractionStarter]: For program point L648''''(lines 648 658) no Hoare annotation was computed. [2018-01-21 08:37:30,792 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-21 08:37:30,792 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 645) no Hoare annotation was computed. [2018-01-21 08:37:30,792 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 08:37:30,793 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-21 08:37:30,793 INFO L404 ceAbstractionStarter]: At program point L662'''(lines 662 666) the Hoare annotation is: true [2018-01-21 08:37:30,793 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-21 08:37:30,793 INFO L404 ceAbstractionStarter]: At program point L648'''(lines 648 658) the Hoare annotation is: true [2018-01-21 08:37:30,793 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-21 08:37:30,793 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 08:37:30,794 INFO L401 ceAbstractionStarter]: For program point L662(lines 662 666) no Hoare annotation was computed. [2018-01-21 08:37:30,794 INFO L404 ceAbstractionStarter]: At program point L660(line 660) the Hoare annotation is: true [2018-01-21 08:37:30,794 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-21 08:37:30,794 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-21 08:37:30,794 INFO L401 ceAbstractionStarter]: For program point L664(line 664) no Hoare annotation was computed. [2018-01-21 08:37:30,794 INFO L401 ceAbstractionStarter]: For program point L639'(line 639) no Hoare annotation was computed. [2018-01-21 08:37:30,794 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 08:37:30,795 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-21 08:37:30,795 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 627 670) no Hoare annotation was computed. [2018-01-21 08:37:30,795 INFO L401 ceAbstractionStarter]: For program point L653(line 653) no Hoare annotation was computed. [2018-01-21 08:37:30,795 INFO L401 ceAbstractionStarter]: For program point L642'''(line 642) no Hoare annotation was computed. [2018-01-21 08:37:30,795 INFO L401 ceAbstractionStarter]: For program point L659(line 659) no Hoare annotation was computed. [2018-01-21 08:37:30,795 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 627 670) the Hoare annotation is: true [2018-01-21 08:37:30,796 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 645) the Hoare annotation is: true [2018-01-21 08:37:30,796 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-21 08:37:30,796 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-21 08:37:30,796 INFO L401 ceAbstractionStarter]: For program point L633''''''(lines 633 645) no Hoare annotation was computed. [2018-01-21 08:37:30,796 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-21 08:37:30,796 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-21 08:37:30,796 INFO L404 ceAbstractionStarter]: At program point L642'(line 642) the Hoare annotation is: true [2018-01-21 08:37:30,801 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:30,801 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:30,801 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:30,801 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:30,801 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:30,802 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:30,802 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:30,802 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:37:30,802 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:30,805 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:37:30,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:37:30,805 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:30,806 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:37:30,807 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:37:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash 164489, now seen corresponding path program 1 times [2018-01-21 08:37:30,812 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:30,829 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:30,829 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:30,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:30,830 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:30,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:30,885 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:37:30,889 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:30,895 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:30,895 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:30,896 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:30,896 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:30,896 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:30,896 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:30,896 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:30,896 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:37:30,896 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:30,899 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:37:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 08:37:30,901 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:30,901 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:30,902 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:37:30,902 INFO L82 PathProgramCache]: Analyzing trace with hash 317555706, now seen corresponding path program 1 times [2018-01-21 08:37:30,902 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:30,903 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:30,904 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:30,904 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:30,904 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:30,930 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:37:31,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:31,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:37:31,036 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:31,038 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:37:31,049 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:37:31,049 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:37:31,052 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 08:37:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:31,071 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-01-21 08:37:31,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:37:31,072 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 08:37:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:31,080 INFO L225 Difference]: With dead ends: 93 [2018-01-21 08:37:31,080 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 08:37:31,082 INFO L525 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 [2018-01-21 08:37:31,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 08:37:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 08:37:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 08:37:31,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-21 08:37:31,113 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 20 [2018-01-21 08:37:31,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:31,113 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-21 08:37:31,114 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:37:31,114 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-21 08:37:31,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 08:37:31,115 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:31,115 INFO L322 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] [2018-01-21 08:37:31,115 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:37:31,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1512252506, now seen corresponding path program 1 times [2018-01-21 08:37:31,116 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:31,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,117 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:31,117 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,117 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:31,179 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:37:31,187 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:31,192 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:31,192 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:31,205 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:37:31,205 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:37:31,205 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:37:31,205 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:37:31,205 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:37:31,205 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:37:31,205 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:37:31,205 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:37:31,206 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:37:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 08:37:31,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 08:37:31,209 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:31,209 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:31,209 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:37:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1081232605, now seen corresponding path program 1 times [2018-01-21 08:37:31,209 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:31,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,210 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:31,210 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,211 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:31,221 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:37:31,235 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:31,236 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:37:31,236 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:31,236 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:37:31,236 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:37:31,236 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:37:31,237 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 08:37:31,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:31,244 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-01-21 08:37:31,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:37:31,244 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 08:37:31,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:31,245 INFO L225 Difference]: With dead ends: 93 [2018-01-21 08:37:31,245 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 08:37:31,246 INFO L525 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 [2018-01-21 08:37:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 08:37:31,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 08:37:31,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 08:37:31,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-21 08:37:31,252 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 18 [2018-01-21 08:37:31,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:31,253 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-21 08:37:31,253 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:37:31,253 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-21 08:37:31,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 08:37:31,254 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:31,254 INFO L322 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] [2018-01-21 08:37:31,254 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 08:37:31,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1804010959, now seen corresponding path program 1 times [2018-01-21 08:37:31,255 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:31,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,256 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:31,256 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,256 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:37:31,279 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:37:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 08:37:31,457 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:37:31,457 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 08:37:31,457 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:37:31,457 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 08:37:31,458 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 08:37:31,458 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:37:31,458 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-21 08:37:31,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:37:31,773 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-21 08:37:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 08:37:31,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 08:37:31,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:37:31,806 INFO L225 Difference]: With dead ends: 109 [2018-01-21 08:37:31,807 INFO L226 Difference]: Without dead ends: 105 [2018-01-21 08:37:31,807 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-21 08:37:31,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-21 08:37:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 74. [2018-01-21 08:37:31,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 08:37:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-01-21 08:37:31,814 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 27 [2018-01-21 08:37:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:37:31,814 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-01-21 08:37:31,815 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 08:37:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-01-21 08:37:31,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 08:37:31,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:37:31,816 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:37:31,816 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 08:37:31,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1429112326, now seen corresponding path program 1 times [2018-01-21 08:37:31,817 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:37:31,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:37:31,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:37:31,818 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:37:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:31,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:37:31,859 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:37:31,864 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:31,869 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:37:31,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:37:31 BoogieIcfgContainer [2018-01-21 08:37:31,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:37:31,876 INFO L168 Benchmark]: Toolchain (without parser) took 1843.98 ms. Allocated memory was 301.5 MB in the beginning and 457.7 MB in the end (delta: 156.2 MB). Free memory was 259.8 MB in the beginning and 364.3 MB in the end (delta: -104.5 MB). Peak memory consumption was 51.7 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:31,877 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:37:31,878 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.11 ms. Allocated memory is still 301.5 MB. Free memory was 258.8 MB in the beginning and 247.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:31,878 INFO L168 Benchmark]: Boogie Preprocessor took 41.50 ms. Allocated memory is still 301.5 MB. Free memory was 247.7 MB in the beginning and 246.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. [2018-01-21 08:37:31,878 INFO L168 Benchmark]: RCFGBuilder took 303.79 ms. Allocated memory is still 301.5 MB. Free memory was 246.7 MB in the beginning and 225.0 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:31,879 INFO L168 Benchmark]: TraceAbstraction took 1277.23 ms. Allocated memory was 301.5 MB in the beginning and 457.7 MB in the end (delta: 156.2 MB). Free memory was 224.0 MB in the beginning and 364.3 MB in the end (delta: -140.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:37:31,881 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 301.5 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.11 ms. Allocated memory is still 301.5 MB. Free memory was 258.8 MB in the beginning and 247.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.50 ms. Allocated memory is still 301.5 MB. Free memory was 247.7 MB in the beginning and 246.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 303.79 ms. Allocated memory is still 301.5 MB. Free memory was 246.7 MB in the beginning and 225.0 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1277.23 ms. Allocated memory was 301.5 MB in the beginning and 457.7 MB in the end (delta: 156.2 MB). Free memory was 224.0 MB in the beginning and 364.3 MB in the end (delta: -140.2 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 525]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: exitErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 12 PreInvPairs, 12 NumberOfFragments, 11 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={17:0}] [L629] a = (List) malloc(sizeof(struct node)) VAL [a={17:0}, malloc(sizeof(struct node))={17:0}] [L630] COND FALSE !(a == 0) VAL [a={17:0}, malloc(sizeof(struct node))={17:0}] [L631] p = a [L632] int i = 0; VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={17:0}, i=0, i < 20 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L647] p = a VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L648] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L662] EXPR, FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->n={0:0}] [L662] COND FALSE !(p->n != 0) [L667] FCALL free(p) VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L668] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 70 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 361 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 627]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L628] List p, a, t; [L629] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={17:0}] [L629] a = (List) malloc(sizeof(struct node)) VAL [a={17:0}, malloc(sizeof(struct node))={17:0}] [L630] COND FALSE !(a == 0) VAL [a={17:0}, malloc(sizeof(struct node))={17:0}] [L631] p = a [L632] int i = 0; VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L633] i < 20 && __VERIFIER_nondet_int() [L633] i < 20 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={17:0}, i=0, i < 20 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L633] COND FALSE !(i < 20 && __VERIFIER_nondet_int()) [L646] FCALL p->h = 3 VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L647] p = a VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L648] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L648] COND FALSE !(p->h != 3) [L659] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L659] COND FALSE !(p->h != 3 || i > 20) [L661] p = a VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L662] EXPR, FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->n={18:0}] [L662] COND TRUE p->n != 0 [L663] EXPR, FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->n={18:0}] [L663] t = p->n [L664] FCALL free(p) VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, t={18:0}] [L665] p = t VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={18:0}, t={18:0}] [L662] EXPR, FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={18:0}, p->n={0:0}, t={18:0}] [L662] COND FALSE !(p->n != 0) [L667] FCALL free(p) VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={18:0}, t={18:0}] [L668] return 0; VAL [\result=0, a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={18:0}, t={18:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 65 locations, 4 error locations. UNSAFE Result, 0.6s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 110 SDtfs, 142 SDslu, 136 SDs, 0 SdLazy, 105 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 31 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 5905 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - InvariantResult [Line: 660]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 633]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 662]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-37-31-891.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-37-31-891.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-37-31-891.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-37-31-891.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_false-unreach-call_false-valid-deref.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-37-31-891.csv Received shutdown request...