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/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:50:36,207 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:50:36,209 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:50:36,223 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:50:36,223 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:50:36,224 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:50:36,225 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:50:36,226 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:50:36,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:50:36,228 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:50:36,229 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:50:36,229 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:50:36,230 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:50:36,231 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:50:36,231 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:50:36,234 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:50:36,236 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:50:36,238 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:50:36,239 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:50:36,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:50:36,243 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:50:36,243 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:50:36,243 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:50:36,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:50:36,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:50:36,246 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:50:36,246 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:50:36,247 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:50:36,247 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:50:36,247 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:50:36,248 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:50:36,248 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:50:36,258 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:50:36,259 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:50:36,259 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:50:36,260 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:50:36,260 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:50:36,260 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:50:36,260 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:50:36,260 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:50:36,261 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:50:36,261 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:50:36,261 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:50:36,262 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:50:36,262 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:50:36,262 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:50:36,262 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:50:36,262 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:50:36,263 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:50:36,263 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:50:36,263 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:50:36,263 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:50:36,263 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:50:36,264 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:50:36,264 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:50:36,264 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:50:36,264 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:50:36,265 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:50:36,265 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:50:36,265 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:50:36,265 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:50:36,265 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:50:36,266 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:50:36,266 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:50:36,266 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:50:36,266 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:50:36,266 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:50:36,266 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:50:36,267 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:50:36,268 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:50:36,268 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:50:36,301 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:50:36,311 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:50:36,314 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:50:36,316 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:50:36,316 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:50:36,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-21 10:50:36,481 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:50:36,486 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:50:36,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:50:36,487 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:50:36,492 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:50:36,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b75990c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36, skipping insertion in model container [2018-01-21 10:50:36,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,512 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:50:36,557 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:50:36,672 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:50:36,692 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:50:36,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36 WrapperNode [2018-01-21 10:50:36,702 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:50:36,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:50:36,703 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:50:36,703 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:50:36,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,726 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,727 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (1/1) ... [2018-01-21 10:50:36,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:50:36,743 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:50:36,743 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:50:36,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:50:36,745 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (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:50:36,792 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:50:36,792 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:50:36,792 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:50:36,792 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:50:36,793 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 10:50:36,794 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:50:36,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:50:36,794 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:50:37,232 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:50:37,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:50:37 BoogieIcfgContainer [2018-01-21 10:50:37,233 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:50:37,234 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:50:37,234 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:50:37,237 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:50:37,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:50:36" (1/3) ... [2018-01-21 10:50:37,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f01cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:50:37, skipping insertion in model container [2018-01-21 10:50:37,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:50:36" (2/3) ... [2018-01-21 10:50:37,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20f01cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:50:37, skipping insertion in model container [2018-01-21 10:50:37,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:50:37" (3/3) ... [2018-01-21 10:50:37,241 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-21 10:50:37,248 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:50:37,256 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 10:50:37,297 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:50:37,298 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:50:37,298 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:50:37,298 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:50:37,298 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:50:37,298 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:50:37,298 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:50:37,298 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:50:37,299 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:50:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 10:50:37,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:50:37,323 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:37,324 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:50:37,325 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:50:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash 267889, now seen corresponding path program 1 times [2018-01-21 10:50:37,331 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:37,384 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:37,384 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:37,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:37,385 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:37,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:50:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:50:37,436 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:50:37,443 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:50:37,450 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:50:37,451 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:50:37,451 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:50:37,451 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:50:37,451 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:50:37,451 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:50:37,451 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:50:37,451 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:50:37,451 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:50:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 10:50:37,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 10:50:37,458 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:37,458 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:50:37,458 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:50:37,458 INFO L82 PathProgramCache]: Analyzing trace with hash 2122179741, now seen corresponding path program 1 times [2018-01-21 10:50:37,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:37,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:37,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:37,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:37,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:50:37,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:50:37,657 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:50:37,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:50:37,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:50:37,660 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:50:37,662 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:50:37,673 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:50:37,674 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:50:37,676 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 10:50:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:50:37,702 INFO L93 Difference]: Finished difference Result 177 states and 235 transitions. [2018-01-21 10:50:37,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:50:37,703 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 10:50:37,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:50:37,716 INFO L225 Difference]: With dead ends: 177 [2018-01-21 10:50:37,716 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 10:50:37,719 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:50:37,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 10:50:37,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-21 10:50:37,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 10:50:37,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-21 10:50:37,758 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 27 [2018-01-21 10:50:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:50:37,759 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-21 10:50:37,759 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:50:37,759 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-21 10:50:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 10:50:37,761 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:37,761 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, 1, 1, 1, 1, 1, 1] [2018-01-21 10:50:37,762 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:50:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash 798686160, now seen corresponding path program 1 times [2018-01-21 10:50:37,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:37,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:37,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:37,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:37,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:50:37,802 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:50:37,961 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:50:37,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:50:37,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 10:50:37,962 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:50:37,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 10:50:37,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 10:50:37,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:50:37,965 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 8 states. [2018-01-21 10:50:38,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:50:38,313 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-01-21 10:50:38,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:50:38,314 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-01-21 10:50:38,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:50:38,319 INFO L225 Difference]: With dead ends: 155 [2018-01-21 10:50:38,319 INFO L226 Difference]: Without dead ends: 135 [2018-01-21 10:50:38,320 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-21 10:50:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-21 10:50:38,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2018-01-21 10:50:38,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 10:50:38,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-21 10:50:38,333 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2018-01-21 10:50:38,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:50:38,333 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-21 10:50:38,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 10:50:38,333 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-21 10:50:38,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 10:50:38,335 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:38,335 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:50:38,335 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:50:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash -611659746, now seen corresponding path program 1 times [2018-01-21 10:50:38,336 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:38,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:38,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,337 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:50:38,364 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:50:38,468 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:50:38,468 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:50:38,469 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 10:50:38,469 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:50:38,469 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 10:50:38,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 10:50:38,470 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:50:38,470 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 8 states. [2018-01-21 10:50:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:50:38,757 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-01-21 10:50:38,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:50:38,758 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-21 10:50:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:50:38,760 INFO L225 Difference]: With dead ends: 132 [2018-01-21 10:50:38,760 INFO L226 Difference]: Without dead ends: 126 [2018-01-21 10:50:38,761 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-01-21 10:50:38,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-21 10:50:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2018-01-21 10:50:38,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 10:50:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-21 10:50:38,770 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 42 [2018-01-21 10:50:38,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:50:38,771 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-21 10:50:38,771 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 10:50:38,771 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-21 10:50:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 10:50:38,773 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:38,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:50:38,773 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:50:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash 1884398603, now seen corresponding path program 1 times [2018-01-21 10:50:38,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:38,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:38,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:38,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:50:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:50:38,843 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:50:38,855 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:50:38,866 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:50:38,867 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:50:38,887 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:50:38,887 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:50:38,887 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:50:38,887 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:50:38,887 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:50:38,888 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:50:38,888 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:50:38,888 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:50:38,888 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:50:38,891 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 10:50:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:50:38,892 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:38,892 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:50:38,893 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:50:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1342988930, now seen corresponding path program 1 times [2018-01-21 10:50:38,893 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:38,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,895 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:38,895 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,895 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:38,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:50:38,908 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:50:38,924 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:50:38,924 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:50:38,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:50:38,925 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:50:38,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 10:50:38,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 10:50:38,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 10:50:38,926 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 10:50:38,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:50:38,932 INFO L93 Difference]: Finished difference Result 177 states and 235 transitions. [2018-01-21 10:50:38,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 10:50:38,932 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 10:50:38,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:50:38,934 INFO L225 Difference]: With dead ends: 177 [2018-01-21 10:50:38,934 INFO L226 Difference]: Without dead ends: 92 [2018-01-21 10:50:38,935 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:50:38,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-21 10:50:38,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-21 10:50:38,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-21 10:50:38,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-01-21 10:50:38,942 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 25 [2018-01-21 10:50:38,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:50:38,943 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-01-21 10:50:38,943 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 10:50:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-01-21 10:50:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 10:50:38,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:38,944 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, 1, 1, 1, 1] [2018-01-21 10:50:38,944 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 10:50:38,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1210340747, now seen corresponding path program 1 times [2018-01-21 10:50:38,945 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:38,946 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,947 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:38,947 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:38,947 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:50:38,968 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:50:39,053 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:50:39,054 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:50:39,054 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 10:50:39,054 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:50:39,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 10:50:39,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 10:50:39,055 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:50:39,055 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 8 states. [2018-01-21 10:50:39,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:50:39,299 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2018-01-21 10:50:39,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:50:39,300 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-21 10:50:39,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:50:39,301 INFO L225 Difference]: With dead ends: 151 [2018-01-21 10:50:39,302 INFO L226 Difference]: Without dead ends: 133 [2018-01-21 10:50:39,302 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-01-21 10:50:39,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-21 10:50:39,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2018-01-21 10:50:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 10:50:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-21 10:50:39,309 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 34 [2018-01-21 10:50:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:50:39,310 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-21 10:50:39,310 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 10:50:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-21 10:50:39,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 10:50:39,311 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:39,311 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:50:39,311 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 10:50:39,311 INFO L82 PathProgramCache]: Analyzing trace with hash -961529277, now seen corresponding path program 1 times [2018-01-21 10:50:39,311 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:39,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:39,312 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:39,312 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:39,312 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:50:39,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:50:39,413 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-21 10:50:39,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:50:39,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 10:50:39,413 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:50:39,414 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 10:50:39,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 10:50:39,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 10:50:39,414 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 8 states. [2018-01-21 10:50:39,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:50:39,571 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-21 10:50:39,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 10:50:39,572 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-01-21 10:50:39,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:50:39,573 INFO L225 Difference]: With dead ends: 128 [2018-01-21 10:50:39,573 INFO L226 Difference]: Without dead ends: 124 [2018-01-21 10:50:39,573 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-01-21 10:50:39,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-21 10:50:39,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2018-01-21 10:50:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 10:50:39,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-21 10:50:39,578 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 40 [2018-01-21 10:50:39,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:50:39,578 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-21 10:50:39,578 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 10:50:39,578 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-21 10:50:39,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 10:50:39,579 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:50:39,579 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:50:39,579 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 10:50:39,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1660607120, now seen corresponding path program 1 times [2018-01-21 10:50:39,580 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:50:39,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:39,581 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:50:39,581 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:50:39,581 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:50:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:50:39,598 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:50:40,166 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:50:40,166 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:50:40,166 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 10:50:40,167 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 10:50:40,169 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [14], [16], [19], [104], [108], [113], [117], [125], [126], [131], [135], [143], [147], [149], [150], [193], [195], [196], [202], [206], [208], [209], [220], [221], [222], [223], [224], [229], [230], [232], [233], [234], [240], [241], [242] [2018-01-21 10:50:40,222 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 10:50:40,223 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-21 10:51:36,590 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-21 10:51:36,591 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-21 10:51:36,608 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 10:51:36,609 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 10:51:36,609 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-21 10:51:36,641 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:51:36,641 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 10:51:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:51:36,698 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 10:51:36,705 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 10:51:36,705 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 10:51:36,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:51:36 BoogieIcfgContainer [2018-01-21 10:51:36,708 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:51:36,708 INFO L168 Benchmark]: Toolchain (without parser) took 60227.22 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 265.5 MB in the beginning and 983.7 MB in the end (delta: -718.1 MB). Peak memory consumption was 1.3 GB. Max. memory is 5.3 GB. [2018-01-21 10:51:36,709 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:51:36,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.11 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 252.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-21 10:51:36,710 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 307.2 MB. Free memory was 252.3 MB in the beginning and 250.3 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:51:36,710 INFO L168 Benchmark]: RCFGBuilder took 489.97 ms. Allocated memory is still 307.2 MB. Free memory was 250.3 MB in the beginning and 220.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:51:36,710 INFO L168 Benchmark]: TraceAbstraction took 59473.47 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 220.8 MB in the beginning and 983.7 MB in the end (delta: -762.9 MB). Peak memory consumption was 1.2 GB. Max. memory is 5.3 GB. [2018-01-21 10:51:36,712 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.13 ms. Allocated memory is still 307.2 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 216.11 ms. Allocated memory is still 307.2 MB. Free memory was 264.5 MB in the beginning and 252.3 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.92 ms. Allocated memory is still 307.2 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 489.97 ms. Allocated memory is still 307.2 MB. Free memory was 250.3 MB in the beginning and 220.8 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 59473.47 ms. Allocated memory was 307.2 MB in the beginning and 2.3 GB in the end (delta: 2.0 GB). Free memory was 220.8 MB in the beginning and 983.7 MB in the end (delta: -762.9 MB). Peak memory consumption was 1.2 GB. 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: - 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 3 procedures, 97 locations, 3 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=97occurred 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: [L995] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={19:0}] [L995] struct TSLL* null = malloc(sizeof(struct TSLL)); VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L996] FCALL null->next = ((void*)0) VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L997] FCALL null->prev = ((void*)0) VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L998] FCALL null->colour = BLACK VAL [malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1000] EXPR, FCALL malloc(sizeof(struct TSLL)) VAL [malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1000] struct TSLL* list = malloc(sizeof(struct TSLL)); VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1001] FCALL list->next = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1002] FCALL list->prev = null VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1003] FCALL list->colour = BLACK VAL [list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1005] struct TSLL* end = list; VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1008] COND FALSE !(__VERIFIER_nondet_int()) [L1034] end = null [L1035] end = list VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1038] COND FALSE !(!(null != end)) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1038] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1039] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1039] COND FALSE !(!(BLACK == end->colour)) [L1039] COND FALSE !(0) VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1040] COND TRUE null != end VAL [end={17:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1042] EXPR, FCALL end->colour VAL [end={17:0}, end->colour=1, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1042] COND FALSE !(RED == end->colour) [L1049] EXPR, FCALL end->next VAL [end={17:0}, end->next={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1049] end = end->next [L1040] COND FALSE !(null != end) VAL [end={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1053] COND TRUE null != list VAL [end={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1055] EXPR, FCALL list->colour VAL [end={19:0}, list={17:0}, list->colour=1, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1055] COND FALSE !(RED == list->colour) [L1064] EXPR, FCALL list->next VAL [end={19:0}, list={17:0}, list->next={19:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1064] end = list->next [L1065] FCALL free(list) VAL [end={19:0}, list={17:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1066] list = end VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1053] COND FALSE !(null != list) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1070] FCALL free(null) VAL [end={19:0}, list={19:0}, malloc(sizeof(struct TSLL))={17:0}, malloc(sizeof(struct TSLL))={19:0}, null={19:0}] [L1072] return 0; - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 3 procedures, 97 locations, 3 error locations. UNSAFE Result, 1.4s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 232 SDtfs, 1017 SDslu, 255 SDs, 0 SdLazy, 273 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=98occurred in iteration=3, 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, 3 MinimizatonAttempts, 67 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 102 ConstructedInterpolants, 0 QuantifiedInterpolants, 8922 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - TimeoutResultAtElement [Line: 993]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 993). Cancelled while BasicCegarLoop was analyzing trace of length 49 with TraceHistMax 2, while TraceCheckSpWp was constructing forward predicates, while XnfDer was eliminating 1 quantified variables from 1 xjuncts. - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 3 procedures, 97 locations, 3 error locations. TIMEOUT Result, 57.8s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 228 SDtfs, 1017 SDslu, 231 SDs, 0 SdLazy, 273 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 56.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 67 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 96 ConstructedInterpolants, 0 QuantifiedInterpolants, 8250 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-51-36-722.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-51-36-722.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-51-36-722.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i_mempurity-32bit-Automizer_Taipan+AI_EQ_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-51-36-722.csv Completed graceful shutdown