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.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 00:08:23,351 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:08:23,352 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:08:23,365 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:08:23,365 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:08:23,366 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:08:23,367 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:08:23,368 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:08:23,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:08:23,370 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:08:23,371 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:08:23,371 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:08:23,372 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:08:23,373 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:08:23,374 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:08:23,377 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:08:23,380 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:08:23,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:08:23,383 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:08:23,384 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:08:23,387 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:08:23,387 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:08:23,387 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:08:23,389 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:08:23,389 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:08:23,391 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:08:23,391 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:08:23,392 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:08:23,392 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:08:23,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:08:23,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:08:23,393 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.epf [2018-01-21 00:08:23,404 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:08:23,404 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:08:23,405 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:08:23,405 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:08:23,406 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:08:23,406 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:08:23,406 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:08:23,407 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:08:23,407 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:08:23,407 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:08:23,407 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:08:23,407 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:08:23,408 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:08:23,408 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:08:23,408 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:08:23,408 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:08:23,408 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:08:23,408 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:08:23,409 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:08:23,409 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:08:23,409 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:08:23,409 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:08:23,409 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:08:23,410 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:08:23,410 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:08:23,410 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:08:23,410 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:08:23,410 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:08:23,411 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:08:23,411 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:08:23,411 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:08:23,411 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:08:23,411 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:08:23,411 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:08:23,412 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:08:23,412 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:08:23,413 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:08:23,413 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:08:23,447 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:08:23,460 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:08:23,465 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:08:23,466 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:08:23,467 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:08:23,468 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 00:08:23,645 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:08:23,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:08:23,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:08:23,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:08:23,660 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:08:23,661 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,664 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 12:08:23, skipping insertion in model container [2018-01-21 00:08:23,664 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,685 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:08:23,729 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:08:23,847 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:08:23,869 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:08:23,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23 WrapperNode [2018-01-21 00:08:23,877 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:08:23,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:08:23,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:08:23,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:08:23,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,901 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,907 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (1/1) ... [2018-01-21 00:08:23,915 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:08:23,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:08:23,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:08:23,916 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:08:23,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (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 00:08:23,967 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:08:23,967 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:08:23,967 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:08:23,967 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-21 00:08:23,967 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-01-21 00:08:23,968 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:08:23,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:08:23,969 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:08:24,385 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:08:24,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:08:24 BoogieIcfgContainer [2018-01-21 00:08:24,386 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:08:24,387 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:08:24,387 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:08:24,389 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:08:24,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:08:23" (1/3) ... [2018-01-21 00:08:24,390 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 12:08:24, skipping insertion in model container [2018-01-21 00:08:24,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:08:23" (2/3) ... [2018-01-21 00:08:24,390 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 12:08:24, skipping insertion in model container [2018-01-21 00:08:24,390 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:08:24" (3/3) ... [2018-01-21 00:08:24,392 INFO L105 eAbstractionObserver]: Analyzing ICFG dll-rb-sentinel_true-unreach-call_true-valid-memsafety.i [2018-01-21 00:08:24,399 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:08:24,407 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-21 00:08:24,461 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:08:24,461 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:08:24,462 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:08:24,462 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:08:24,462 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:08:24,462 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:08:24,462 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:08:24,463 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:08:24,464 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:08:24,488 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:08:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:08:24,495 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:24,496 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:08:24,496 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:08:24,502 INFO L82 PathProgramCache]: Analyzing trace with hash 267889, now seen corresponding path program 1 times [2018-01-21 00:08:24,505 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:24,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:24,578 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:24,578 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:24,578 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:24,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:08:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:08:24,641 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:08:24,649 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:08:24,658 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:08:24,658 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:08:24,658 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:08:24,658 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:08:24,658 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:08:24,659 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:08:24,659 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:08:24,659 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:08:24,659 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:08:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:08:24,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:08:24,665 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:24,665 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 00:08:24,665 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:08:24,665 INFO L82 PathProgramCache]: Analyzing trace with hash 2122179741, now seen corresponding path program 1 times [2018-01-21 00:08:24,666 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:24,668 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:24,668 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:24,669 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:24,669 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:08:24,710 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:08:24,858 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 00:08:24,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:08:24,859 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:08:24,859 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:08:24,861 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:08:24,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:08:24,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:08:24,874 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:08:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:08:24,898 INFO L93 Difference]: Finished difference Result 177 states and 235 transitions. [2018-01-21 00:08:24,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:08:24,899 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-21 00:08:24,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:08:24,908 INFO L225 Difference]: With dead ends: 177 [2018-01-21 00:08:24,908 INFO L226 Difference]: Without dead ends: 94 [2018-01-21 00:08:24,911 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 00:08:24,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-01-21 00:08:24,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2018-01-21 00:08:24,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 00:08:24,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-21 00:08:24,945 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 27 [2018-01-21 00:08:24,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:08:24,946 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-21 00:08:24,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:08:24,946 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-21 00:08:24,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-21 00:08:24,947 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:24,947 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 00:08:24,947 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:08:24,948 INFO L82 PathProgramCache]: Analyzing trace with hash 798686160, now seen corresponding path program 1 times [2018-01-21 00:08:24,948 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:24,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:24,949 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:24,949 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:24,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:08:24,987 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:08:25,101 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 00:08:25,102 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:08:25,102 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:08:25,102 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:08:25,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:08:25,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:08:25,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:08:25,105 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 8 states. [2018-01-21 00:08:25,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:08:25,449 INFO L93 Difference]: Finished difference Result 155 states and 168 transitions. [2018-01-21 00:08:25,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:08:25,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2018-01-21 00:08:25,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:08:25,454 INFO L225 Difference]: With dead ends: 155 [2018-01-21 00:08:25,454 INFO L226 Difference]: Without dead ends: 135 [2018-01-21 00:08:25,456 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 00:08:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-21 00:08:25,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 96. [2018-01-21 00:08:25,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 00:08:25,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-21 00:08:25,467 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 36 [2018-01-21 00:08:25,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:08:25,468 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-21 00:08:25,468 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:08:25,468 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-21 00:08:25,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:08:25,469 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:25,469 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 00:08:25,469 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:08:25,470 INFO L82 PathProgramCache]: Analyzing trace with hash -611659746, now seen corresponding path program 1 times [2018-01-21 00:08:25,470 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:25,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:25,471 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:25,471 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:25,471 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:25,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:08:25,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:08:25,645 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 00:08:25,646 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:08:25,646 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:08:25,646 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:08:25,646 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:08:25,647 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:08:25,647 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:08:25,647 INFO L87 Difference]: Start difference. First operand 96 states and 101 transitions. Second operand 8 states. [2018-01-21 00:08:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:08:25,886 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-01-21 00:08:25,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:08:25,887 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-01-21 00:08:25,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:08:25,889 INFO L225 Difference]: With dead ends: 132 [2018-01-21 00:08:25,889 INFO L226 Difference]: Without dead ends: 126 [2018-01-21 00:08:25,890 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 00:08:25,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-21 00:08:25,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 98. [2018-01-21 00:08:25,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-01-21 00:08:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2018-01-21 00:08:25,900 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 42 [2018-01-21 00:08:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:08:25,901 INFO L432 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2018-01-21 00:08:25,901 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:08:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2018-01-21 00:08:25,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-01-21 00:08:25,903 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:25,903 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 00:08:25,903 INFO L371 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:08:25,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1884398603, now seen corresponding path program 1 times [2018-01-21 00:08:25,904 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:25,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:25,905 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:25,905 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:25,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:25,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:08:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:08:25,972 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:08:25,985 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:08:25,996 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:08:25,997 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:08:26,017 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:08:26,017 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:08:26,017 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:08:26,017 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:08:26,018 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:08:26,018 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:08:26,018 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:08:26,018 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:08:26,018 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:08:26,021 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states. [2018-01-21 00:08:26,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:08:26,022 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:26,023 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 00:08:26,023 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:08:26,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1342988930, now seen corresponding path program 1 times [2018-01-21 00:08:26,024 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:26,025 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,026 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:26,026 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,026 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:08:26,040 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:08:26,054 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 00:08:26,055 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:08:26,055 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:08:26,055 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:08:26,056 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:08:26,056 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:08:26,056 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:08:26,057 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 2 states. [2018-01-21 00:08:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:08:26,062 INFO L93 Difference]: Finished difference Result 177 states and 235 transitions. [2018-01-21 00:08:26,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:08:26,062 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-21 00:08:26,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:08:26,063 INFO L225 Difference]: With dead ends: 177 [2018-01-21 00:08:26,063 INFO L226 Difference]: Without dead ends: 92 [2018-01-21 00:08:26,064 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 00:08:26,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-01-21 00:08:26,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2018-01-21 00:08:26,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-01-21 00:08:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2018-01-21 00:08:26,072 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 25 [2018-01-21 00:08:26,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:08:26,073 INFO L432 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2018-01-21 00:08:26,073 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:08:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2018-01-21 00:08:26,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-21 00:08:26,074 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:26,074 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 00:08:26,074 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:08:26,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1210340747, now seen corresponding path program 1 times [2018-01-21 00:08:26,075 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:26,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:26,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,077 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:08:26,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:08:26,182 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 00:08:26,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:08:26,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:08:26,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:08:26,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:08:26,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:08:26,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:08:26,183 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 8 states. [2018-01-21 00:08:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:08:26,449 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2018-01-21 00:08:26,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:08:26,449 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-01-21 00:08:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:08:26,450 INFO L225 Difference]: With dead ends: 151 [2018-01-21 00:08:26,451 INFO L226 Difference]: Without dead ends: 133 [2018-01-21 00:08:26,451 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 00:08:26,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-21 00:08:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2018-01-21 00:08:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-01-21 00:08:26,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2018-01-21 00:08:26,457 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 34 [2018-01-21 00:08:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:08:26,458 INFO L432 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2018-01-21 00:08:26,458 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:08:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2018-01-21 00:08:26,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-21 00:08:26,459 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:26,459 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 00:08:26,459 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:08:26,459 INFO L82 PathProgramCache]: Analyzing trace with hash -961529277, now seen corresponding path program 1 times [2018-01-21 00:08:26,459 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:26,460 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,460 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:26,461 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,461 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:08:26,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:08:26,559 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 00:08:26,559 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:08:26,559 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:08:26,560 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:08:26,560 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:08:26,560 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:08:26,560 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:08:26,560 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand 8 states. [2018-01-21 00:08:26,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:08:26,740 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2018-01-21 00:08:26,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-21 00:08:26,740 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-01-21 00:08:26,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:08:26,741 INFO L225 Difference]: With dead ends: 128 [2018-01-21 00:08:26,741 INFO L226 Difference]: Without dead ends: 124 [2018-01-21 00:08:26,742 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 00:08:26,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-21 00:08:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2018-01-21 00:08:26,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-01-21 00:08:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 101 transitions. [2018-01-21 00:08:26,749 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 101 transitions. Word has length 40 [2018-01-21 00:08:26,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:08:26,750 INFO L432 AbstractCegarLoop]: Abstraction has 96 states and 101 transitions. [2018-01-21 00:08:26,750 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:08:26,750 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 101 transitions. [2018-01-21 00:08:26,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 00:08:26,751 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:08:26,751 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 00:08:26,752 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation]=== [2018-01-21 00:08:26,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1660607120, now seen corresponding path program 1 times [2018-01-21 00:08:26,752 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:08:26,753 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,753 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:08:26,754 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:08:26,754 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:08:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:08:26,772 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:08:27,155 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 00:08:27,155 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:08:27,155 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-21 00:08:27,156 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 49 with the following transitions: [2018-01-21 00:08:27,158 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 00:08:27,206 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-21 00:08:27,206 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... [2018-01-21 00:09:26,072 WARN L571 FixpointEngine]: Received timeout, aborting fixpoint engine [2018-01-21 00:09:26,073 WARN L157 AbstractInterpreter]: Abstract interpretation run out of time [2018-01-21 00:09:26,073 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-01-21 00:09:26,073 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-21 00:09:26,074 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 00:09:26,099 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:09:26,099 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-21 00:09:26,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:09:26,148 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-21 00:09:26,152 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-21 00:09:26,153 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-21 00:09:26,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:09:26 BoogieIcfgContainer [2018-01-21 00:09:26,155 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:09:26,156 INFO L168 Benchmark]: Toolchain (without parser) took 62510.33 ms. Allocated memory was 300.4 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 258.7 MB in the beginning and 2.1 GB in the end (delta: -1.8 GB). Peak memory consumption was 112.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:09:26,157 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:09:26,157 INFO L168 Benchmark]: CACSL2BoogieTranslator took 225.10 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 245.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-21 00:09:26,158 INFO L168 Benchmark]: Boogie Preprocessor took 37.68 ms. Allocated memory is still 300.4 MB. Free memory was 245.5 MB in the beginning and 243.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:09:26,158 INFO L168 Benchmark]: RCFGBuilder took 470.52 ms. Allocated memory is still 300.4 MB. Free memory was 243.5 MB in the beginning and 213.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:09:26,159 INFO L168 Benchmark]: TraceAbstraction took 61768.69 ms. Allocated memory was 300.4 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 213.9 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 68.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:09:26,161 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 300.4 MB. Free memory is still 264.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 225.10 ms. Allocated memory is still 300.4 MB. Free memory was 257.7 MB in the beginning and 245.5 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.68 ms. Allocated memory is still 300.4 MB. Free memory was 245.5 MB in the beginning and 243.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 470.52 ms. Allocated memory is still 300.4 MB. Free memory was 243.5 MB in the beginning and 213.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 61768.69 ms. Allocated memory was 300.4 MB in the beginning and 2.2 GB in the end (delta: 1.9 GB). Free memory was 213.9 MB in the beginning and 2.1 GB in the end (delta: -1.9 GB). Peak memory consumption was 68.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * 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.2s 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.3s OverallTime, 4 OverallIterations, 2 TraceHistogramMax, 0.6s 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, 60.1s 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.2s 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, 58.9s 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.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-09-26-170.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-09-26-170.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-09-26-170.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.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-09-26-170.csv Completed graceful shutdown