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_smtcomp.epf -i ../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:26:22,301 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:26:22,302 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:26:22,317 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:26:22,317 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:26:22,318 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:26:22,320 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:26:22,321 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:26:22,323 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:26:22,324 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:26:22,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:26:22,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:26:22,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:26:22,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:26:22,328 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:26:22,330 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:26:22,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:26:22,335 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:26:22,336 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:26:22,337 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:26:22,339 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:26:22,340 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:26:22,340 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:26:22,341 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:26:22,342 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:26:22,343 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:26:22,343 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:26:22,344 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:26:22,344 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:26:22,344 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:26:22,345 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:26:22,345 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_smtcomp.epf [2018-01-21 10:26:22,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:26:22,354 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:26:22,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:26:22,355 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:26:22,355 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:26:22,355 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:26:22,355 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:26:22,355 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:26:22,356 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:26:22,356 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:26:22,356 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:26:22,356 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:26:22,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:26:22,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:26:22,357 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:26:22,357 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:26:22,357 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:26:22,357 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:26:22,357 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:26:22,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:26:22,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:26:22,358 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:26:22,358 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:26:22,358 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:26:22,358 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:26:22,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:26:22,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:26:22,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:26:22,359 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:26:22,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:26:22,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:26:22,360 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:26:22,360 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:26:22,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:26:22,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:26:22,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:26:22,360 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:26:22,361 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:26:22,361 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:26:22,393 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:26:22,403 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:26:22,406 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:26:22,408 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:26:22,408 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:26:22,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/simple-ext_1_true-valid-memsafety.i [2018-01-21 10:26:22,566 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:26:22,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:26:22,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:26:22,572 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:26:22,577 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:26:22,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,581 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 10:26:22, skipping insertion in model container [2018-01-21 10:26:22,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,594 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:26:22,631 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:26:22,751 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:26:22,773 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:26:22,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22 WrapperNode [2018-01-21 10:26:22,782 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:26:22,782 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:26:22,782 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:26:22,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:26:22,797 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (1/1) ... [2018-01-21 10:26:22,819 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:26:22,819 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:26:22,819 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:26:22,819 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:26:22,820 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (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 10:26:22,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:26:22,875 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:26:22,875 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 10:26:22,875 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:26:22,875 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:26:22,875 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:26:22,875 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:26:22,875 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:26:22,876 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:26:22,876 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:26:22,876 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:26:22,876 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:26:22,876 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 10:26:22,876 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:26:22,876 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:26:22,877 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 10:26:22,877 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:26:22,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:26:22,877 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:26:23,117 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:26:23,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:26:23 BoogieIcfgContainer [2018-01-21 10:26:23,118 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:26:23,119 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:26:23,119 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:26:23,121 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:26:23,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:26:22" (1/3) ... [2018-01-21 10:26:23,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49df0bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:26:23, skipping insertion in model container [2018-01-21 10:26:23,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:22" (2/3) ... [2018-01-21 10:26:23,123 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49df0bb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:26:23, skipping insertion in model container [2018-01-21 10:26:23,123 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:26:23" (3/3) ... [2018-01-21 10:26:23,124 INFO L105 eAbstractionObserver]: Analyzing ICFG simple-ext_1_true-valid-memsafety.i [2018-01-21 10:26:23,131 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:26:23,137 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 10:26:23,175 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:23,175 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:23,175 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:23,175 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:23,175 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:23,175 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:23,176 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:23,176 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 10:26:23,176 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:23,194 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-21 10:26:23,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:26:23,209 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 49 states. [2018-01-21 10:26:23,268 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 526) no Hoare annotation was computed. [2018-01-21 10:26:23,268 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 620 622) no Hoare annotation was computed. [2018-01-21 10:26:23,269 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 620 622) the Hoare annotation is: true [2018-01-21 10:26:23,269 INFO L401 ceAbstractionStarter]: For program point L621(line 621) no Hoare annotation was computed. [2018-01-21 10:26:23,269 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 620 622) no Hoare annotation was computed. [2018-01-21 10:26:23,269 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 659) no Hoare annotation was computed. [2018-01-21 10:26:23,269 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 659) no Hoare annotation was computed. [2018-01-21 10:26:23,270 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 659) the Hoare annotation is: true [2018-01-21 10:26:23,270 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 659) no Hoare annotation was computed. [2018-01-21 10:26:23,270 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 659) the Hoare annotation is: true [2018-01-21 10:26:23,270 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 659) no Hoare annotation was computed. [2018-01-21 10:26:23,270 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 659) the Hoare annotation is: true [2018-01-21 10:26:23,270 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 659) no Hoare annotation was computed. [2018-01-21 10:26:23,271 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 659) no Hoare annotation was computed. [2018-01-21 10:26:23,271 INFO L401 ceAbstractionStarter]: For program point L645'''(lines 645 651) no Hoare annotation was computed. [2018-01-21 10:26:23,271 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 10:26:23,271 INFO L401 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-21 10:26:23,271 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-21 10:26:23,271 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 627 659) no Hoare annotation was computed. [2018-01-21 10:26:23,271 INFO L401 ceAbstractionStarter]: For program point L655(line 655) no Hoare annotation was computed. [2018-01-21 10:26:23,272 INFO L401 ceAbstractionStarter]: For program point L654(line 654) no Hoare annotation was computed. [2018-01-21 10:26:23,272 INFO L404 ceAbstractionStarter]: At program point L653''(lines 653 657) the Hoare annotation is: true [2018-01-21 10:26:23,272 INFO L401 ceAbstractionStarter]: For program point L653(lines 653 657) no Hoare annotation was computed. [2018-01-21 10:26:23,272 INFO L401 ceAbstractionStarter]: For program point L629'''(line 629) no Hoare annotation was computed. [2018-01-21 10:26:23,272 INFO L401 ceAbstractionStarter]: For program point L646'''(lines 646 648) no Hoare annotation was computed. [2018-01-21 10:26:23,272 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 627 659) no Hoare annotation was computed. [2018-01-21 10:26:23,273 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 627 659) the Hoare annotation is: true [2018-01-21 10:26:23,273 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 640) the Hoare annotation is: true [2018-01-21 10:26:23,273 INFO L404 ceAbstractionStarter]: At program point L636'(line 636) the Hoare annotation is: true [2018-01-21 10:26:23,273 INFO L401 ceAbstractionStarter]: For program point L636'''(line 636) no Hoare annotation was computed. [2018-01-21 10:26:23,273 INFO L401 ceAbstractionStarter]: For program point L653'''(lines 653 657) no Hoare annotation was computed. [2018-01-21 10:26:23,273 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 10:26:23,273 INFO L401 ceAbstractionStarter]: For program point L645(lines 645 651) no Hoare annotation was computed. [2018-01-21 10:26:23,274 INFO L404 ceAbstractionStarter]: At program point L645''(lines 645 651) the Hoare annotation is: true [2018-01-21 10:26:23,274 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-21 10:26:23,274 INFO L401 ceAbstractionStarter]: For program point L649(line 649) no Hoare annotation was computed. [2018-01-21 10:26:23,274 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 10:26:23,274 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 10:26:23,274 INFO L401 ceAbstractionStarter]: For program point L633''''''(lines 633 640) no Hoare annotation was computed. [2018-01-21 10:26:23,274 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-21 10:26:23,275 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-21 10:26:23,275 INFO L404 ceAbstractionStarter]: At program point L629'(line 629) the Hoare annotation is: true [2018-01-21 10:26:23,275 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 627 659) no Hoare annotation was computed. [2018-01-21 10:26:23,275 INFO L401 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-21 10:26:23,275 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 640) no Hoare annotation was computed. [2018-01-21 10:26:23,275 INFO L401 ceAbstractionStarter]: For program point L638(line 638) no Hoare annotation was computed. [2018-01-21 10:26:23,275 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 10:26:23,276 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-21 10:26:23,276 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-21 10:26:23,276 INFO L401 ceAbstractionStarter]: For program point L646'(line 646) no Hoare annotation was computed. [2018-01-21 10:26:23,276 INFO L401 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-21 10:26:23,276 INFO L401 ceAbstractionStarter]: For program point L654'(line 654) no Hoare annotation was computed. [2018-01-21 10:26:23,280 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:23,281 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:23,281 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:23,281 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:23,281 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:23,281 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:23,282 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:23,282 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:26:23,282 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-21 10:26:23,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:26:23,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:23,286 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:26:23,286 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:26:23,292 INFO L82 PathProgramCache]: Analyzing trace with hash 135692, now seen corresponding path program 1 times [2018-01-21 10:26:23,295 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:23,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,319 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:23,319 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,319 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:23,379 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:26:23,385 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:23,390 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:23,391 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:23,391 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:23,391 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:23,391 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:23,391 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:23,391 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:23,391 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:26:23,392 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:23,394 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-21 10:26:23,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 10:26:23,395 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:23,396 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 10:26:23,396 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:26:23,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1622057019, now seen corresponding path program 1 times [2018-01-21 10:26:23,396 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:23,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,398 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:23,398 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,398 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:23,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:23,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:23,458 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 10:26:23,460 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:23,460 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:26:23,461 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:23,533 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:26:23,548 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:26:23,549 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:26:23,551 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-21 10:26:23,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:23,567 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-01-21 10:26:23,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:26:23,568 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 10:26:23,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:23,574 INFO L225 Difference]: With dead ends: 73 [2018-01-21 10:26:23,574 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 10:26:23,576 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 10:26:23,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 10:26:23,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 10:26:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 10:26:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-21 10:26:23,604 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-21 10:26:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:23,604 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-21 10:26:23,604 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:26:23,605 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-21 10:26:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:26:23,605 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:23,606 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] [2018-01-21 10:26:23,606 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:26:23,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1506847670, now seen corresponding path program 1 times [2018-01-21 10:26:23,606 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:23,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,607 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:23,607 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,607 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:23,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:23,637 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:23,729 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 10:26:23,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:23,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:26:23,729 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:23,731 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:26:23,732 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:26:23,732 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:26:23,732 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 5 states. [2018-01-21 10:26:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:23,858 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2018-01-21 10:26:23,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:26:23,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-01-21 10:26:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:23,860 INFO L225 Difference]: With dead ends: 79 [2018-01-21 10:26:23,860 INFO L226 Difference]: Without dead ends: 67 [2018-01-21 10:26:23,862 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:26:23,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-21 10:26:23,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 45. [2018-01-21 10:26:23,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-21 10:26:23,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2018-01-21 10:26:23,870 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 25 [2018-01-21 10:26:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:23,871 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2018-01-21 10:26:23,871 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:26:23,871 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2018-01-21 10:26:23,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 10:26:23,872 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:23,872 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, 1, 1, 1] [2018-01-21 10:26:23,873 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:26:23,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1533825156, now seen corresponding path program 1 times [2018-01-21 10:26:23,873 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:23,874 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,874 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:23,875 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,875 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:23,943 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:26:23,951 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:23,958 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:23,958 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:23,974 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:23,974 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:23,974 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:23,974 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:23,974 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:23,974 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:23,974 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:23,975 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:26:23,975 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:23,976 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-21 10:26:23,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:26:23,978 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:23,978 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 10:26:23,978 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:23,978 INFO L82 PathProgramCache]: Analyzing trace with hash 220682052, now seen corresponding path program 1 times [2018-01-21 10:26:23,978 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:23,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,979 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:23,979 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:23,980 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:23,988 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:23,999 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 10:26:24,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:24,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:26:24,000 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:24,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:26:24,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:26:24,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:26:24,001 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-21 10:26:24,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:24,006 INFO L93 Difference]: Finished difference Result 73 states and 85 transitions. [2018-01-21 10:26:24,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:26:24,006 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-21 10:26:24,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:24,007 INFO L225 Difference]: With dead ends: 73 [2018-01-21 10:26:24,007 INFO L226 Difference]: Without dead ends: 39 [2018-01-21 10:26:24,008 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 10:26:24,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-01-21 10:26:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-01-21 10:26:24,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-21 10:26:24,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-21 10:26:24,013 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-01-21 10:26:24,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:24,013 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-21 10:26:24,014 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:26:24,014 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-21 10:26:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 10:26:24,015 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:24,015 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] [2018-01-21 10:26:24,015 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:24,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1544798995, now seen corresponding path program 1 times [2018-01-21 10:26:24,016 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:24,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:24,017 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:24,017 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:24,017 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:24,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:24,031 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:24,082 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 10:26:24,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:24,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:26:24,083 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:24,083 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:26:24,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:26:24,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:26:24,084 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 5 states. [2018-01-21 10:26:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:24,181 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-01-21 10:26:24,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:26:24,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-21 10:26:24,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:24,183 INFO L225 Difference]: With dead ends: 75 [2018-01-21 10:26:24,183 INFO L226 Difference]: Without dead ends: 65 [2018-01-21 10:26:24,183 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-21 10:26:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-21 10:26:24,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 43. [2018-01-21 10:26:24,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 10:26:24,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-21 10:26:24,190 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 23 [2018-01-21 10:26:24,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:24,190 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-21 10:26:24,191 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:26:24,191 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-21 10:26:24,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 10:26:24,192 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:24,192 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, 1] [2018-01-21 10:26:24,192 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:24,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1056343501, now seen corresponding path program 1 times [2018-01-21 10:26:24,192 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:24,193 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:24,194 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:24,194 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:24,194 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:24,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:24,213 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:26:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:26:24,385 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:26:24,385 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:26:24,385 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-21 10:26:24,387 INFO L201 CegarAbsIntRunner]: [0], [1], [7], [9], [13], [15], [18], [24], [43], [44], [45], [49], [53], [55], [56], [63], [65], [66], [70], [74], [78], [80], [81], [82], [83], [84], [88], [90], [96], [97], [107], [108], [109] [2018-01-21 10:26:24,436 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:26:24,436 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:26:40,268 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:294) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:157) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:117) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:296) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.arrays.DiffWrapperScript.term(DiffWrapperScript.java:286) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.lambda$1(CongruenceClosureSmtUtils.java:29) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.Iterator.forEachRemaining(Iterator.java:116) at java.util.Spliterators$IteratorSpliterator.forEachRemaining(Spliterators.java:1801) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.CongruenceClosureSmtUtils.congruenceClosureToCube(CongruenceClosureSmtUtils.java:30) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.WeqCcManager.weqCcToTerm(WeqCcManager.java:935) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqConstraint.getTerm(EqConstraint.java:185) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.lambda$2(EqDisjunctiveConstraint.java:121) at java.util.stream.ReferencePipeline$3$1.accept(ReferencePipeline.java:193) at java.util.HashMap$KeySpliterator.forEachRemaining(HashMap.java:1548) at java.util.stream.AbstractPipeline.copyInto(AbstractPipeline.java:481) at java.util.stream.AbstractPipeline.wrapAndCopyInto(AbstractPipeline.java:471) at java.util.stream.ReduceOps$ReduceOp.evaluateSequential(ReduceOps.java:708) at java.util.stream.AbstractPipeline.evaluate(AbstractPipeline.java:234) at java.util.stream.ReferencePipeline.collect(ReferencePipeline.java:499) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.vpdomain.EqDisjunctiveConstraint.getTerm(EqDisjunctiveConstraint.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPredicate.(EqPredicate.java:64) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqStateFactory.stateToPredicate(EqStateFactory.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqState.toEqPredicate(EqState.java:224) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:121) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.vp.EqPostOperator.apply(EqPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$16(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:443) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:363) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:148) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:388) ... 21 more [2018-01-21 10:26:40,271 INFO L168 Benchmark]: Toolchain (without parser) took 17703.76 ms. Allocated memory was 305.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 263.4 MB in the beginning and 795.5 MB in the end (delta: -532.1 MB). Peak memory consumption was 806.9 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:40,272 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:26:40,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.40 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:40,272 INFO L168 Benchmark]: Boogie Preprocessor took 36.34 ms. Allocated memory is still 305.1 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:40,273 INFO L168 Benchmark]: RCFGBuilder took 299.02 ms. Allocated memory is still 305.1 MB. Free memory was 250.4 MB in the beginning and 230.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:40,273 INFO L168 Benchmark]: TraceAbstraction took 17150.82 ms. Allocated memory was 305.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 230.6 MB in the beginning and 795.5 MB in the end (delta: -565.0 MB). Peak memory consumption was 774.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:40,274 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.12 ms. Allocated memory is still 305.1 MB. Free memory is still 269.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.40 ms. Allocated memory is still 305.1 MB. Free memory was 262.5 MB in the beginning and 252.4 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.34 ms. Allocated memory is still 305.1 MB. Free memory was 252.4 MB in the beginning and 250.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 299.02 ms. Allocated memory is still 305.1 MB. Free memory was 250.4 MB in the beginning and 230.6 MB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 17150.82 ms. Allocated memory was 305.1 MB in the beginning and 1.6 GB in the end (delta: 1.3 GB). Free memory was 230.6 MB in the beginning and 795.5 MB in the end (delta: -565.0 MB). Peak memory consumption was 774.1 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 526]: 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, 52 locations, 4 error locations. SAFE Result, 0.1s OverallTime, 0 OverallIterations, 0 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 10 LocationsWithAnnotation, 11 PreInvPairs, 11 NumberOfFragments, 10 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 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, 52 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=49occurred 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] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={13:0}] [L628] List a = (List) malloc(sizeof(struct node)); VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L629] COND FALSE !(a == 0) VAL [a={13:0}, malloc(sizeof(struct node))={13:0}] [L630] List t; [L631] List p = a; [L632] int i = 0; VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L633] i < 30 && __VERIFIER_nondet_int() [L633] i < 30 && __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, a={13:0}, i=0, i < 30 && __VERIFIER_nondet_int()=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L633] COND FALSE !(i < 30 && __VERIFIER_nondet_int()) [L641] FCALL p->h = i VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L642] FCALL p->n = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L643] p = a [L644] i = 0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L645] COND TRUE p!=0 VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}] [L646] EXPR, FCALL p->h VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->h=0] [L646] COND FALSE !(p->h != i) [L649] EXPR, FCALL p->n VAL [a={13:0}, i=0, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}] [L649] p = p->n [L650] i++ VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}] [L645] COND FALSE !(p!=0) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}] [L652] p = a VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}] [L653] COND TRUE p != 0 VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}] [L654] EXPR, FCALL p->n VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}, p->n={0:0}] [L654] t = p->n [L655] FCALL free(p) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={13:0}, t={0:0}] [L656] p = t VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}, t={0:0}] [L653] COND FALSE !(p != 0) VAL [a={13:0}, i=1, malloc(sizeof(struct node))={13:0}, p={0:0}, t={0:0}] [L658] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 52 locations, 4 error locations. UNSAFE Result, 0.5s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 81 SDtfs, 134 SDslu, 38 SDs, 0 SdLazy, 34 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred 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, 2 MinimizatonAttempts, 22 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 82 NumberOfCodeBlocks, 82 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 1801 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 - ExceptionOrErrorResult: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (distinct Bool Int): de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:399) RESULT: Ultimate could not prove your program: Toolchain returned no result. Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-26-40-281.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-26-40-281.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-26-40-281.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/simple-ext_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-26-40-281.csv Received shutdown request...