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_mostprecise.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 03:11:30,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:11:30,824 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:11:30,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:11:30,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:11:30,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:11:30,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:11:30,845 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:11:30,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:11:30,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:11:30,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:11:30,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:11:30,850 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:11:30,851 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:11:30,852 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:11:30,854 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:11:30,857 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:11:30,859 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:11:30,860 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:11:30,862 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:11:30,864 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:11:30,865 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:11:30,865 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:11:30,866 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:11:30,867 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:11:30,868 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:11:30,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:11:30,869 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:11:30,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:11:30,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:11:30,871 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:11:30,871 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_mostprecise.epf [2018-01-21 03:11:30,881 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:11:30,881 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:11:30,882 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:11:30,882 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:11:30,883 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:11:30,883 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:11:30,883 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:11:30,883 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:11:30,883 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:11:30,884 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:11:30,884 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:11:30,884 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:11:30,885 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:11:30,885 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:11:30,885 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:11:30,885 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:11:30,885 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:11:30,886 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:11:30,886 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:11:30,886 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:11:30,886 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:11:30,886 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:11:30,886 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:11:30,887 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:11:30,887 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:11:30,887 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:11:30,887 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:11:30,887 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:11:30,887 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:11:30,888 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:11:30,888 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:11:30,888 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:11:30,888 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:11:30,888 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:11:30,888 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:11:30,889 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:11:30,889 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:11:30,889 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:11:30,890 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:11:30,890 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:11:30,928 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:11:30,941 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:11:30,946 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:11:30,948 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:11:30,948 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:11:30,949 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 03:11:31,158 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:11:31,162 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:11:31,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:11:31,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:11:31,172 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:11:31,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@300e3574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31, skipping insertion in model container [2018-01-21 03:11:31,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,223 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:11:31,265 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:11:31,402 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:11:31,430 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:11:31,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31 WrapperNode [2018-01-21 03:11:31,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:11:31,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:11:31,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:11:31,440 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:11:31,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,468 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,472 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,473 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (1/1) ... [2018-01-21 03:11:31,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:11:31,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:11:31,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:11:31,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:11:31,477 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (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 03:11:31,536 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:11:31,536 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:11:31,537 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 03:11:31,537 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:11:31,537 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 03:11:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:11:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:11:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:11:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 03:11:31,538 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:11:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:11:31,539 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:11:31,931 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:11:31,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:11:31 BoogieIcfgContainer [2018-01-21 03:11:31,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:11:31,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:11:31,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:11:31,936 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:11:31,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:11:31" (1/3) ... [2018-01-21 03:11:31,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd69498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:11:31, skipping insertion in model container [2018-01-21 03:11:31,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:11:31" (2/3) ... [2018-01-21 03:11:31,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cd69498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:11:31, skipping insertion in model container [2018-01-21 03:11:31,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:11:31" (3/3) ... [2018-01-21 03:11:31,940 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_flag_false-unreach-call_false-valid-deref.i [2018-01-21 03:11:31,950 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:11:31,957 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 03:11:32,012 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:32,012 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:32,012 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:32,013 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:32,013 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:32,013 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:32,013 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:32,013 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 03:11:32,014 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:32,038 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:11:32,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:11:32,060 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 62 states. [2018-01-21 03:11:32,194 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 03:11:32,194 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 03:11:32,195 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 03:11:32,195 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 03:11:32,195 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 03:11:32,195 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 670) no Hoare annotation was computed. [2018-01-21 03:11:32,195 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 670) no Hoare annotation was computed. [2018-01-21 03:11:32,196 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 670) the Hoare annotation is: true [2018-01-21 03:11:32,196 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 670) no Hoare annotation was computed. [2018-01-21 03:11:32,197 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 670) the Hoare annotation is: true [2018-01-21 03:11:32,197 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 670) no Hoare annotation was computed. [2018-01-21 03:11:32,197 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 670) the Hoare annotation is: true [2018-01-21 03:11:32,197 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 670) no Hoare annotation was computed. [2018-01-21 03:11:32,197 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 670) no Hoare annotation was computed. [2018-01-21 03:11:32,198 INFO L401 ceAbstractionStarter]: For program point L662''''(lines 662 666) no Hoare annotation was computed. [2018-01-21 03:11:32,198 INFO L401 ceAbstractionStarter]: For program point L662'(line 662) no Hoare annotation was computed. [2018-01-21 03:11:32,198 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-21 03:11:32,198 INFO L401 ceAbstractionStarter]: For program point L649'''(lines 649 655) no Hoare annotation was computed. [2018-01-21 03:11:32,198 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 03:11:32,198 INFO L401 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-21 03:11:32,199 INFO L401 ceAbstractionStarter]: For program point L663'(line 663) no Hoare annotation was computed. [2018-01-21 03:11:32,199 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 627 670) no Hoare annotation was computed. [2018-01-21 03:11:32,199 INFO L401 ceAbstractionStarter]: For program point L648'(line 648) no Hoare annotation was computed. [2018-01-21 03:11:32,199 INFO L401 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-21 03:11:32,199 INFO L401 ceAbstractionStarter]: For program point L664'(line 664) no Hoare annotation was computed. [2018-01-21 03:11:32,199 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 03:11:32,199 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-21 03:11:32,200 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 03:11:32,200 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-21 03:11:32,200 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 03:11:32,200 INFO L401 ceAbstractionStarter]: For program point L648(lines 648 658) no Hoare annotation was computed. [2018-01-21 03:11:32,200 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 03:11:32,200 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-21 03:11:32,201 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-21 03:11:32,201 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 627 670) no Hoare annotation was computed. [2018-01-21 03:11:32,201 INFO L401 ceAbstractionStarter]: For program point L648''''(lines 648 658) no Hoare annotation was computed. [2018-01-21 03:11:32,202 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-21 03:11:32,202 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 645) no Hoare annotation was computed. [2018-01-21 03:11:32,203 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 03:11:32,203 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-21 03:11:32,203 INFO L404 ceAbstractionStarter]: At program point L662'''(lines 662 666) the Hoare annotation is: true [2018-01-21 03:11:32,203 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-21 03:11:32,205 INFO L404 ceAbstractionStarter]: At program point L648'''(lines 648 658) the Hoare annotation is: true [2018-01-21 03:11:32,205 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-21 03:11:32,206 INFO L401 ceAbstractionStarter]: For program point L663(line 663) no Hoare annotation was computed. [2018-01-21 03:11:32,206 INFO L401 ceAbstractionStarter]: For program point L662(lines 662 666) no Hoare annotation was computed. [2018-01-21 03:11:32,206 INFO L404 ceAbstractionStarter]: At program point L660(line 660) the Hoare annotation is: true [2018-01-21 03:11:32,206 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-21 03:11:32,206 INFO L401 ceAbstractionStarter]: For program point L667(line 667) no Hoare annotation was computed. [2018-01-21 03:11:32,207 INFO L401 ceAbstractionStarter]: For program point L664(line 664) no Hoare annotation was computed. [2018-01-21 03:11:32,207 INFO L401 ceAbstractionStarter]: For program point L639'(line 639) no Hoare annotation was computed. [2018-01-21 03:11:32,207 INFO L401 ceAbstractionStarter]: For program point L650(line 650) no Hoare annotation was computed. [2018-01-21 03:11:32,207 INFO L401 ceAbstractionStarter]: For program point L656(line 656) no Hoare annotation was computed. [2018-01-21 03:11:32,207 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 627 670) no Hoare annotation was computed. [2018-01-21 03:11:32,207 INFO L401 ceAbstractionStarter]: For program point L653(line 653) no Hoare annotation was computed. [2018-01-21 03:11:32,207 INFO L401 ceAbstractionStarter]: For program point L642'''(line 642) no Hoare annotation was computed. [2018-01-21 03:11:32,208 INFO L401 ceAbstractionStarter]: For program point L659(line 659) no Hoare annotation was computed. [2018-01-21 03:11:32,208 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 627 670) the Hoare annotation is: true [2018-01-21 03:11:32,208 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 645) the Hoare annotation is: true [2018-01-21 03:11:32,208 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-21 03:11:32,208 INFO L401 ceAbstractionStarter]: For program point L649'(line 649) no Hoare annotation was computed. [2018-01-21 03:11:32,208 INFO L401 ceAbstractionStarter]: For program point L633''''''(lines 633 645) no Hoare annotation was computed. [2018-01-21 03:11:32,215 INFO L401 ceAbstractionStarter]: For program point L653'(line 653) no Hoare annotation was computed. [2018-01-21 03:11:32,215 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-21 03:11:32,216 INFO L404 ceAbstractionStarter]: At program point L642'(line 642) the Hoare annotation is: true [2018-01-21 03:11:32,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:32,223 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:32,223 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:32,223 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:32,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:32,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:32,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:32,224 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:11:32,224 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:32,226 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:11:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:11:32,227 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:32,228 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:11:32,231 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:11:32,238 INFO L82 PathProgramCache]: Analyzing trace with hash 164489, now seen corresponding path program 1 times [2018-01-21 03:11:32,241 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:32,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,267 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:32,267 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,268 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:32,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:32,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:32,356 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:11:32,367 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:32,377 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:32,377 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:32,377 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:32,378 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:32,378 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:32,378 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:32,378 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:32,378 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:11:32,378 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:11:32,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 03:11:32,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:32,384 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 03:11:32,384 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:11:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash 317555706, now seen corresponding path program 1 times [2018-01-21 03:11:32,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:32,389 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,390 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:32,390 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,390 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:32,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:32,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:32,575 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 03:11:32,577 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:32,578 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:11:32,578 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:32,582 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:11:32,605 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:11:32,606 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:11:32,609 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 03:11:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:32,639 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-01-21 03:11:32,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:11:32,641 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 03:11:32,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:32,652 INFO L225 Difference]: With dead ends: 93 [2018-01-21 03:11:32,652 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 03:11:32,655 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 03:11:32,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 03:11:32,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 03:11:32,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 03:11:32,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2018-01-21 03:11:32,701 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 20 [2018-01-21 03:11:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:32,702 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2018-01-21 03:11:32,702 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:11:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-01-21 03:11:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 03:11:32,704 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:32,704 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 03:11:32,704 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:11:32,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1512252506, now seen corresponding path program 1 times [2018-01-21 03:11:32,705 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:32,706 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,706 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:32,707 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,707 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:32,797 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:11:32,809 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:32,814 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:32,815 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:32,828 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:11:32,828 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:11:32,828 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:11:32,829 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:11:32,829 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:11:32,829 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:11:32,829 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:11:32,829 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:11:32,829 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:11:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2018-01-21 03:11:32,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 03:11:32,833 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:32,833 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 03:11:32,834 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:11:32,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1081232605, now seen corresponding path program 1 times [2018-01-21 03:11:32,834 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:32,835 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,836 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:32,836 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,836 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:32,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:32,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:32,871 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 03:11:32,872 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:32,872 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:11:32,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:32,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:11:32,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:11:32,873 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:11:32,873 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 2 states. [2018-01-21 03:11:32,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:32,889 INFO L93 Difference]: Finished difference Result 93 states and 112 transitions. [2018-01-21 03:11:32,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:11:32,889 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 03:11:32,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:32,891 INFO L225 Difference]: With dead ends: 93 [2018-01-21 03:11:32,891 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 03:11:32,892 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 03:11:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 03:11:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 03:11:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 03:11:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2018-01-21 03:11:32,908 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 18 [2018-01-21 03:11:32,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:32,908 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2018-01-21 03:11:32,908 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:11:32,908 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2018-01-21 03:11:32,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 03:11:32,910 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:32,910 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 03:11:32,910 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 03:11:32,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1804010959, now seen corresponding path program 1 times [2018-01-21 03:11:32,911 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:32,914 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,915 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:32,915 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:32,915 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:11:32,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:11:33,195 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 03:11:33,195 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:11:33,196 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:11:33,196 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:11:33,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 03:11:33,197 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 03:11:33,197 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 03:11:33,198 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand 6 states. [2018-01-21 03:11:33,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:11:33,869 INFO L93 Difference]: Finished difference Result 109 states and 122 transitions. [2018-01-21 03:11:33,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 03:11:33,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 03:11:33,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:11:33,873 INFO L225 Difference]: With dead ends: 109 [2018-01-21 03:11:33,874 INFO L226 Difference]: Without dead ends: 105 [2018-01-21 03:11:33,875 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-21 03:11:33,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-21 03:11:33,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 74. [2018-01-21 03:11:33,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-21 03:11:33,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-01-21 03:11:33,891 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 27 [2018-01-21 03:11:33,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:11:33,891 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-01-21 03:11:33,891 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 03:11:33,892 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-01-21 03:11:33,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 03:11:33,893 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:11:33,893 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 03:11:33,893 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 03:11:33,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1429112326, now seen corresponding path program 1 times [2018-01-21 03:11:33,894 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:11:33,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:33,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:11:33,896 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:11:33,896 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:11:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:11:33,965 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:11:33,972 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:33,977 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:11:33,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:11:33 BoogieIcfgContainer [2018-01-21 03:11:33,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:11:33,992 INFO L168 Benchmark]: Toolchain (without parser) took 2833.52 ms. Allocated memory was 305.7 MB in the beginning and 470.3 MB in the end (delta: 164.6 MB). Free memory was 263.8 MB in the beginning and 377.4 MB in the end (delta: -113.6 MB). Peak memory consumption was 51.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:33,993 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 305.7 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:11:33,994 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.49 ms. Allocated memory is still 305.7 MB. Free memory was 262.8 MB in the beginning and 251.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 03:11:33,994 INFO L168 Benchmark]: Boogie Preprocessor took 35.09 ms. Allocated memory is still 305.7 MB. Free memory was 251.7 MB in the beginning and 250.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 03:11:33,994 INFO L168 Benchmark]: RCFGBuilder took 456.40 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 228.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:33,995 INFO L168 Benchmark]: TraceAbstraction took 2057.99 ms. Allocated memory was 305.7 MB in the beginning and 470.3 MB in the end (delta: 164.6 MB). Free memory was 228.3 MB in the beginning and 377.4 MB in the end (delta: -149.2 MB). Peak memory consumption was 15.5 MB. Max. memory is 5.3 GB. [2018-01-21 03:11:33,997 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.22 ms. Allocated memory is still 305.7 MB. Free memory is still 269.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 276.49 ms. Allocated memory is still 305.7 MB. Free memory was 262.8 MB in the beginning and 251.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 35.09 ms. Allocated memory is still 305.7 MB. Free memory was 251.7 MB in the beginning and 250.7 MB in the end (delta: 996.1 kB). Peak memory consumption was 996.1 kB. Max. memory is 5.3 GB. * RCFGBuilder took 456.40 ms. Allocated memory is still 305.7 MB. Free memory was 250.7 MB in the beginning and 228.3 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2057.99 ms. Allocated memory was 305.7 MB in the beginning and 470.3 MB in the end (delta: 164.6 MB). Free memory was 228.3 MB in the beginning and 377.4 MB in the end (delta: -149.2 MB). Peak memory consumption was 15.5 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.2s 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.1s 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.4s 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, 1.1s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.6s 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s 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.2s 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_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-11-34-008.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-11-34-008.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-11-34-008.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-11-34-008.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_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-11-34-008.csv Received shutdown request...