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/list-ext_flag_1_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:26:09,383 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:26:09,385 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:26:09,398 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:26:09,399 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:26:09,400 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:26:09,401 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:26:09,427 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:26:09,428 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:26:09,429 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:26:09,430 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:26:09,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:26:09,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:26:09,431 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:26:09,432 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:26:09,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:26:09,437 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:26:09,439 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:26:09,441 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:26:09,442 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:26:09,445 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:26:09,445 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:26:09,445 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:26:09,447 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:26:09,448 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:26:09,449 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:26:09,449 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:26:09,450 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:26:09,450 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:26:09,450 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:26:09,451 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:26:09,451 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:09,461 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:26:09,462 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:26:09,463 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:26:09,463 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:26:09,463 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:26:09,463 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:26:09,463 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:26:09,464 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:26:09,464 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:26:09,465 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:26:09,465 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:26:09,465 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:26:09,465 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:26:09,465 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:26:09,465 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:26:09,466 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:26:09,466 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:26:09,466 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:26:09,466 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:26:09,466 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:26:09,467 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:26:09,467 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:26:09,467 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:26:09,467 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:26:09,467 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:26:09,468 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:26:09,468 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:26:09,468 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:26:09,468 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:26:09,468 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:26:09,468 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:26:09,469 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:26:09,469 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:26:09,469 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:26:09,469 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:26:09,469 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:26:09,470 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:26:09,470 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:26:09,471 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:26:09,506 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:26:09,519 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:26:09,524 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:26:09,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:26:09,526 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:26:09,527 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/list-ext_flag_1_true-valid-memsafety.i [2018-01-21 10:26:09,708 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:26:09,713 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:26:09,714 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:26:09,714 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:26:09,722 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:26:09,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:26:09" (1/1) ... [2018-01-21 10:26:09,725 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c517b10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:09, skipping insertion in model container [2018-01-21 10:26:09,725 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:26:09" (1/1) ... [2018-01-21 10:26:09,745 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:26:09,788 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:26:09,908 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:26:09,927 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:26:09,936 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:09 WrapperNode [2018-01-21 10:26:09,936 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:26:09,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:26:09,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:26:09,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:26:09,954 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:09" (1/1) ... [2018-01-21 10:26:09,954 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:09" (1/1) ... [2018-01-21 10:26:09,963 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:09" (1/1) ... [2018-01-21 10:26:09,963 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:09" (1/1) ... [2018-01-21 10:26:09,967 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:09" (1/1) ... [2018-01-21 10:26:09,970 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:09" (1/1) ... [2018-01-21 10:26:09,972 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:09" (1/1) ... [2018-01-21 10:26:09,973 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:26:09,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:26:09,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:26:09,974 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:26:09,975 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:09" (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:10,019 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:26:10,020 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:26:10,020 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-01-21 10:26:10,020 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:26:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:26:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:26:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:26:10,020 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:26:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:26:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:26:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:26:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 10:26:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:26:10,021 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:26:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:26:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-01-21 10:26:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:26:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:26:10,022 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:26:10,304 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:26:10,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:26:10 BoogieIcfgContainer [2018-01-21 10:26:10,305 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:26:10,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:26:10,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:26:10,307 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:26:10,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:26:09" (1/3) ... [2018-01-21 10:26:10,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307b1e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:26:10, skipping insertion in model container [2018-01-21 10:26:10,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:26:09" (2/3) ... [2018-01-21 10:26:10,309 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@307b1e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:26:10, skipping insertion in model container [2018-01-21 10:26:10,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:26:10" (3/3) ... [2018-01-21 10:26:10,311 INFO L105 eAbstractionObserver]: Analyzing ICFG list-ext_flag_1_true-valid-memsafety.i [2018-01-21 10:26:10,319 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:26:10,326 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 10:26:10,374 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:10,375 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:10,375 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:10,375 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:10,375 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:10,375 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:10,375 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:10,375 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == exitErr0EnsuresViolation======== [2018-01-21 10:26:10,376 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:10,392 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 10:26:10,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:26:10,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 63 states. [2018-01-21 10:26:10,479 INFO L401 ceAbstractionStarter]: For program point exitErr0EnsuresViolation(line 525) no Hoare annotation was computed. [2018-01-21 10:26:10,479 INFO L401 ceAbstractionStarter]: For program point exitFINAL(lines 619 621) no Hoare annotation was computed. [2018-01-21 10:26:10,480 INFO L404 ceAbstractionStarter]: At program point exitENTRY(lines 619 621) the Hoare annotation is: true [2018-01-21 10:26:10,480 INFO L401 ceAbstractionStarter]: For program point L620(line 620) no Hoare annotation was computed. [2018-01-21 10:26:10,480 INFO L401 ceAbstractionStarter]: For program point exitEXIT(lines 619 621) no Hoare annotation was computed. [2018-01-21 10:26:10,480 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 672) no Hoare annotation was computed. [2018-01-21 10:26:10,481 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 672) no Hoare annotation was computed. [2018-01-21 10:26:10,481 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 672) the Hoare annotation is: true [2018-01-21 10:26:10,481 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 672) no Hoare annotation was computed. [2018-01-21 10:26:10,481 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 672) the Hoare annotation is: true [2018-01-21 10:26:10,481 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 672) no Hoare annotation was computed. [2018-01-21 10:26:10,482 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 672) the Hoare annotation is: true [2018-01-21 10:26:10,482 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 672) no Hoare annotation was computed. [2018-01-21 10:26:10,482 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 672) no Hoare annotation was computed. [2018-01-21 10:26:10,482 INFO L401 ceAbstractionStarter]: For program point L650'(line 650) no Hoare annotation was computed. [2018-01-21 10:26:10,482 INFO L404 ceAbstractionStarter]: At program point L664'''(lines 664 668) the Hoare annotation is: true [2018-01-21 10:26:10,483 INFO L401 ceAbstractionStarter]: For program point L629(line 629) no Hoare annotation was computed. [2018-01-21 10:26:10,483 INFO L401 ceAbstractionStarter]: For program point L635'(line 635) no Hoare annotation was computed. [2018-01-21 10:26:10,483 INFO L401 ceAbstractionStarter]: For program point L664''''(lines 664 668) no Hoare annotation was computed. [2018-01-21 10:26:10,483 INFO L404 ceAbstractionStarter]: At program point L650'''(lines 650 660) the Hoare annotation is: true [2018-01-21 10:26:10,483 INFO L401 ceAbstractionStarter]: For program point L651'(line 651) no Hoare annotation was computed. [2018-01-21 10:26:10,483 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 627 672) no Hoare annotation was computed. [2018-01-21 10:26:10,484 INFO L401 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-21 10:26:10,484 INFO L401 ceAbstractionStarter]: For program point L664'(line 664) no Hoare annotation was computed. [2018-01-21 10:26:10,484 INFO L401 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-21 10:26:10,484 INFO L401 ceAbstractionStarter]: For program point L644(line 644) no Hoare annotation was computed. [2018-01-21 10:26:10,484 INFO L401 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-21 10:26:10,484 INFO L401 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-21 10:26:10,484 INFO L401 ceAbstractionStarter]: For program point L647(line 647) no Hoare annotation was computed. [2018-01-21 10:26:10,485 INFO L401 ceAbstractionStarter]: For program point L646(line 646) no Hoare annotation was computed. [2018-01-21 10:26:10,485 INFO L401 ceAbstractionStarter]: For program point L650''''(lines 650 660) no Hoare annotation was computed. [2018-01-21 10:26:10,485 INFO L401 ceAbstractionStarter]: For program point L633'(line 633) no Hoare annotation was computed. [2018-01-21 10:26:10,485 INFO L401 ceAbstractionStarter]: For program point L629'(line 629) no Hoare annotation was computed. [2018-01-21 10:26:10,485 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 627 672) no Hoare annotation was computed. [2018-01-21 10:26:10,485 INFO L401 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-21 10:26:10,485 INFO L401 ceAbstractionStarter]: For program point L633(lines 633 645) no Hoare annotation was computed. [2018-01-21 10:26:10,486 INFO L401 ceAbstractionStarter]: For program point L637(line 637) no Hoare annotation was computed. [2018-01-21 10:26:10,486 INFO L401 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-21 10:26:10,486 INFO L401 ceAbstractionStarter]: For program point L635(line 635) no Hoare annotation was computed. [2018-01-21 10:26:10,486 INFO L401 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-21 10:26:10,486 INFO L401 ceAbstractionStarter]: For program point L651'''(lines 651 657) no Hoare annotation was computed. [2018-01-21 10:26:10,487 INFO L404 ceAbstractionStarter]: At program point L662(line 662) the Hoare annotation is: true [2018-01-21 10:26:10,487 INFO L401 ceAbstractionStarter]: For program point L661(line 661) no Hoare annotation was computed. [2018-01-21 10:26:10,487 INFO L404 ceAbstractionStarter]: At program point L630'(line 630) the Hoare annotation is: true [2018-01-21 10:26:10,487 INFO L401 ceAbstractionStarter]: For program point L666(line 666) no Hoare annotation was computed. [2018-01-21 10:26:10,487 INFO L401 ceAbstractionStarter]: For program point L665(line 665) no Hoare annotation was computed. [2018-01-21 10:26:10,488 INFO L401 ceAbstractionStarter]: For program point L664(lines 664 668) no Hoare annotation was computed. [2018-01-21 10:26:10,488 INFO L401 ceAbstractionStarter]: For program point L669(line 669) no Hoare annotation was computed. [2018-01-21 10:26:10,488 INFO L401 ceAbstractionStarter]: For program point L655'(line 655) no Hoare annotation was computed. [2018-01-21 10:26:10,488 INFO L401 ceAbstractionStarter]: For program point L639'(line 639) no Hoare annotation was computed. [2018-01-21 10:26:10,488 INFO L401 ceAbstractionStarter]: For program point L652(line 652) no Hoare annotation was computed. [2018-01-21 10:26:10,488 INFO L401 ceAbstractionStarter]: For program point L651(line 651) no Hoare annotation was computed. [2018-01-21 10:26:10,489 INFO L401 ceAbstractionStarter]: For program point L650(lines 650 660) no Hoare annotation was computed. [2018-01-21 10:26:10,489 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 627 672) no Hoare annotation was computed. [2018-01-21 10:26:10,489 INFO L401 ceAbstractionStarter]: For program point L655(line 655) no Hoare annotation was computed. [2018-01-21 10:26:10,489 INFO L401 ceAbstractionStarter]: For program point L642'''(line 642) no Hoare annotation was computed. [2018-01-21 10:26:10,489 INFO L401 ceAbstractionStarter]: For program point L658(line 658) no Hoare annotation was computed. [2018-01-21 10:26:10,489 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 627 672) the Hoare annotation is: true [2018-01-21 10:26:10,490 INFO L404 ceAbstractionStarter]: At program point L633'''''(lines 633 645) the Hoare annotation is: true [2018-01-21 10:26:10,490 INFO L401 ceAbstractionStarter]: For program point L630'''(line 630) no Hoare annotation was computed. [2018-01-21 10:26:10,490 INFO L401 ceAbstractionStarter]: For program point L652'(line 652) no Hoare annotation was computed. [2018-01-21 10:26:10,490 INFO L401 ceAbstractionStarter]: For program point L633''''''(lines 633 645) no Hoare annotation was computed. [2018-01-21 10:26:10,490 INFO L401 ceAbstractionStarter]: For program point L665'(line 665) no Hoare annotation was computed. [2018-01-21 10:26:10,490 INFO L401 ceAbstractionStarter]: For program point L633'''(line 633) no Hoare annotation was computed. [2018-01-21 10:26:10,491 INFO L401 ceAbstractionStarter]: For program point L666'(line 666) no Hoare annotation was computed. [2018-01-21 10:26:10,491 INFO L404 ceAbstractionStarter]: At program point L642'(line 642) the Hoare annotation is: true [2018-01-21 10:26:10,495 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:10,496 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:10,496 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:10,496 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:10,496 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:10,496 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:10,496 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:10,497 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:26:10,497 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:10,499 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 10:26:10,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:26:10,500 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:10,501 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:26:10,502 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:26:10,507 INFO L82 PathProgramCache]: Analyzing trace with hash 165482, now seen corresponding path program 1 times [2018-01-21 10:26:10,510 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:10,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:10,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,533 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:10,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:10,601 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:26:10,608 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:10,614 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:10,614 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:10,615 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:10,615 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:10,615 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:10,615 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:10,615 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:10,615 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:26:10,616 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:10,618 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 10:26:10,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 10:26:10,620 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:10,620 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] [2018-01-21 10:26:10,620 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:26:10,621 INFO L82 PathProgramCache]: Analyzing trace with hash -2074680006, now seen corresponding path program 1 times [2018-01-21 10:26:10,621 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:10,622 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,623 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:10,623 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,623 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:10,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:10,648 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:10,683 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:10,751 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:10,752 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:26:10,752 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:10,755 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:26:10,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:26:10,767 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:26:10,769 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-21 10:26:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:10,787 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-01-21 10:26:10,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:26:10,788 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-01-21 10:26:10,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:10,795 INFO L225 Difference]: With dead ends: 95 [2018-01-21 10:26:10,795 INFO L226 Difference]: Without dead ends: 55 [2018-01-21 10:26:10,798 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:10,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-21 10:26:10,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-21 10:26:10,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 10:26:10,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 60 transitions. [2018-01-21 10:26:10,830 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 60 transitions. Word has length 21 [2018-01-21 10:26:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:10,830 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 60 transitions. [2018-01-21 10:26:10,830 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:26:10,830 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 60 transitions. [2018-01-21 10:26:10,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-21 10:26:10,832 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:10,832 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, 1] [2018-01-21 10:26:10,832 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:26:10,832 INFO L82 PathProgramCache]: Analyzing trace with hash 973057652, now seen corresponding path program 1 times [2018-01-21 10:26:10,832 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:10,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,834 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:10,834 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,834 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:26:10,911 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:26:10,919 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:10,924 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:10,924 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:26:10,936 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:26:10,936 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:26:10,936 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:26:10,936 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:26:10,937 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:26:10,937 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:26:10,937 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:26:10,937 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:26:10,937 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:26:10,939 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 10:26:10,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 10:26:10,940 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:10,941 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:26:10,941 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:10,941 INFO L82 PathProgramCache]: Analyzing trace with hash 404544579, now seen corresponding path program 1 times [2018-01-21 10:26:10,941 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:10,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:10,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,943 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:10,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:10,955 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:10,969 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:10,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:10,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:26:10,969 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:10,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:26:10,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:26:10,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:26:10,970 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 2 states. [2018-01-21 10:26:10,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:10,975 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2018-01-21 10:26:10,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:26:10,976 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-01-21 10:26:10,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:10,977 INFO L225 Difference]: With dead ends: 95 [2018-01-21 10:26:10,977 INFO L226 Difference]: Without dead ends: 53 [2018-01-21 10:26:10,978 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:10,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-21 10:26:10,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-21 10:26:10,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-21 10:26:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2018-01-21 10:26:10,983 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 19 [2018-01-21 10:26:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:10,984 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2018-01-21 10:26:10,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:26:10,984 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2018-01-21 10:26:10,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-21 10:26:10,984 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:10,985 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] [2018-01-21 10:26:10,985 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:10,985 INFO L82 PathProgramCache]: Analyzing trace with hash -839209987, now seen corresponding path program 1 times [2018-01-21 10:26:10,985 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:10,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,986 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:10,986 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:10,986 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:11,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:11,011 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:11,187 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:11,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:26:11,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:26:11,187 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:26:11,188 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 10:26:11,188 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 10:26:11,188 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-21 10:26:11,189 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand 6 states. [2018-01-21 10:26:11,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:26:11,464 INFO L93 Difference]: Finished difference Result 111 states and 124 transitions. [2018-01-21 10:26:11,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-21 10:26:11,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2018-01-21 10:26:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:26:11,466 INFO L225 Difference]: With dead ends: 111 [2018-01-21 10:26:11,466 INFO L226 Difference]: Without dead ends: 107 [2018-01-21 10:26:11,467 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-01-21 10:26:11,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-21 10:26:11,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 76. [2018-01-21 10:26:11,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-21 10:26:11,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2018-01-21 10:26:11,479 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 28 [2018-01-21 10:26:11,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:26:11,479 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2018-01-21 10:26:11,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 10:26:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-01-21 10:26:11,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 10:26:11,481 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:26:11,481 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:11,481 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:26:11,481 INFO L82 PathProgramCache]: Analyzing trace with hash 355911597, now seen corresponding path program 1 times [2018-01-21 10:26:11,482 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:26:11,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:11,483 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:26:11,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:26:11,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:26:11,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:26:11,503 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:11,738 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 10:26:11,738 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:26:11,738 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:26:11,739 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 36 with the following transitions: [2018-01-21 10:26:11,742 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [8], [10], [14], [16], [19], [25], [54], [55], [56], [60], [62], [65], [92], [97], [101], [103], [106], [108], [109], [110], [111], [112], [116], [117], [120], [126], [127], [137], [138], [139] [2018-01-21 10:26:11,803 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:26:11,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-21 10:26:20,523 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:20,526 INFO L168 Benchmark]: Toolchain (without parser) took 10818.13 ms. Allocated memory was 308.3 MB in the beginning and 1.1 GB in the end (delta: 839.9 MB). Free memory was 266.6 MB in the beginning and 646.4 MB in the end (delta: -379.8 MB). Peak memory consumption was 460.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:20,527 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:26:20,528 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.39 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 254.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:20,528 INFO L168 Benchmark]: Boogie Preprocessor took 36.40 ms. Allocated memory is still 308.3 MB. Free memory was 254.5 MB in the beginning and 253.5 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-21 10:26:20,528 INFO L168 Benchmark]: RCFGBuilder took 330.94 ms. Allocated memory is still 308.3 MB. Free memory was 253.5 MB in the beginning and 230.8 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:20,529 INFO L168 Benchmark]: TraceAbstraction took 10220.29 ms. Allocated memory was 308.3 MB in the beginning and 1.1 GB in the end (delta: 839.9 MB). Free memory was 230.8 MB in the beginning and 646.4 MB in the end (delta: -415.6 MB). Peak memory consumption was 424.3 MB. Max. memory is 5.3 GB. [2018-01-21 10:26:20,531 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.23 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 222.39 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 254.5 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 36.40 ms. Allocated memory is still 308.3 MB. Free memory was 254.5 MB in the beginning and 253.5 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 330.94 ms. Allocated memory is still 308.3 MB. Free memory was 253.5 MB in the beginning and 230.8 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 10220.29 ms. Allocated memory was 308.3 MB in the beginning and 1.1 GB in the end (delta: 839.9 MB). Free memory was 230.8 MB in the beginning and 646.4 MB in the end (delta: -415.6 MB). Peak memory consumption was 424.3 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: 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, 66 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=63occurred 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, 66 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=63occurred 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] FCALL p->n = 0 VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L648] p = a [L649] i = 0 VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L650] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L650] COND FALSE !(p->h != 3) [L661] EXPR, FCALL p->h VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->h=3] [L661] COND FALSE !(p->h != 3 || i > 20) [L663] p = a VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L664] EXPR, FCALL p->n VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}, p->n={0:0}] [L664] COND FALSE !(p->n != 0) [L669] FCALL free(p) VAL [a={17:0}, i=0, malloc(sizeof(struct node))={17:0}, p={17:0}] [L670] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 66 locations, 4 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 71 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=63occurred 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.0s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 400 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 - 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/list-ext_flag_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-26-20-538.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-26-20-538.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-26-20-538.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list-ext_flag_1_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-26-20-538.csv Received shutdown request...