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_imprecise.epf -i ../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:32:10,232 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:32:10,233 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:32:10,249 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:32:10,250 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:32:10,251 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:32:10,252 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:32:10,253 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:32:10,256 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:32:10,257 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:32:10,257 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:32:10,258 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:32:10,259 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:32:10,260 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:32:10,261 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:32:10,263 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:32:10,265 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:32:10,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:32:10,269 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:32:10,270 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:32:10,272 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:32:10,273 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:32:10,273 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:32:10,274 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:32:10,275 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:32:10,276 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:32:10,276 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:32:10,277 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:32:10,277 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:32:10,277 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:32:10,278 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:32:10,278 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_imprecise.epf [2018-01-21 00:32:10,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:32:10,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:32:10,288 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:32:10,288 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:32:10,288 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:32:10,288 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:32:10,288 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:32:10,288 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:32:10,289 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:32:10,289 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:32:10,289 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:32:10,289 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:32:10,289 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:32:10,290 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:32:10,291 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:32:10,291 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:32:10,291 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:32:10,291 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:32:10,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:32:10,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:32:10,292 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:32:10,292 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:32:10,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:32:10,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:32:10,292 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:32:10,292 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:32:10,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:32:10,293 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:32:10,293 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:32:10,293 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:32:10,293 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:32:10,294 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:32:10,326 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:32:10,336 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:32:10,340 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:32:10,341 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:32:10,341 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:32:10,342 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-01-21 00:32:10,501 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:32:10,505 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:32:10,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:32:10,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:32:10,512 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:32:10,513 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,516 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27608974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10, skipping insertion in model container [2018-01-21 00:32:10,516 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,530 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:32:10,568 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:32:10,680 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:32:10,703 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:32:10,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10 WrapperNode [2018-01-21 00:32:10,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:32:10,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:32:10,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:32:10,712 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:32:10,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,724 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,742 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (1/1) ... [2018-01-21 00:32:10,743 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:32:10,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:32:10,744 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:32:10,744 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:32:10,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (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:32:10,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:32:10,794 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:32:10,794 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 00:32:10,794 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 00:32:10,795 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:32:10,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:32:10,796 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:32:11,044 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:32:11,045 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:32:11 BoogieIcfgContainer [2018-01-21 00:32:11,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:32:11,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:32:11,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:32:11,047 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:32:11,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:32:10" (1/3) ... [2018-01-21 00:32:11,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632a57b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:32:11, skipping insertion in model container [2018-01-21 00:32:11,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:32:10" (2/3) ... [2018-01-21 00:32:11,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@632a57b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:32:11, skipping insertion in model container [2018-01-21 00:32:11,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:32:11" (3/3) ... [2018-01-21 00:32:11,051 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-01-21 00:32:11,060 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:32:11,067 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:32:11,120 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:11,120 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:11,120 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:11,120 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:11,121 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:11,121 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:11,121 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:11,121 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:32:11,122 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:11,143 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 00:32:11,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:32:11,149 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:11,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:32:11,151 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:32:11,155 INFO L82 PathProgramCache]: Analyzing trace with hash 125893, now seen corresponding path program 1 times [2018-01-21 00:32:11,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:11,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:11,204 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:11,204 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:11,204 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:11,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:11,259 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:32:11,265 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:11,272 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:11,273 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:11,273 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:11,273 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:11,273 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:11,273 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:11,273 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:11,273 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:32:11,274 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 00:32:11,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:32:11,278 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:11,278 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:32:11,278 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:32:11,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1201666841, now seen corresponding path program 1 times [2018-01-21 00:32:11,279 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:11,280 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:11,280 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:11,281 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:11,281 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:11,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:11,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:11,335 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:32:11,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:11,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:32:11,337 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:11,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:32:11,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:32:11,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:32:11,441 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-21 00:32:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:11,463 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-21 00:32:11,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:32:11,464 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 00:32:11,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:11,475 INFO L225 Difference]: With dead ends: 105 [2018-01-21 00:32:11,475 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 00:32:11,478 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:32:11,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 00:32:11,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-21 00:32:11,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 00:32:11,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-21 00:32:11,511 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 17 [2018-01-21 00:32:11,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:11,512 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-21 00:32:11,512 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:32:11,512 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-21 00:32:11,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:32:11,514 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:11,514 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, 1] [2018-01-21 00:32:11,514 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:32:11,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1521991172, now seen corresponding path program 1 times [2018-01-21 00:32:11,514 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:11,515 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:11,516 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:11,516 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:11,516 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:11,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:11,555 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:11,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 00:32:11,729 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:11,729 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:32:11,729 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:11,730 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:32:11,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:32:11,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:32:11,731 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 8 states. [2018-01-21 00:32:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:11,978 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-21 00:32:11,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:32:11,979 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-21 00:32:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:11,983 INFO L225 Difference]: With dead ends: 93 [2018-01-21 00:32:11,983 INFO L226 Difference]: Without dead ends: 71 [2018-01-21 00:32:11,985 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-21 00:32:11,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-21 00:32:11,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-01-21 00:32:11,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 00:32:11,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-21 00:32:11,997 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 37 [2018-01-21 00:32:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:11,998 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-21 00:32:11,998 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:32:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-21 00:32:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 00:32:12,000 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:12,000 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:32:12,000 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:32:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1267549394, now seen corresponding path program 1 times [2018-01-21 00:32:12,001 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:12,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,002 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:12,002 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,002 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:12,036 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:12,169 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:32:12,170 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:12,170 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:32:12,170 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:12,171 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:32:12,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:32:12,171 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:32:12,171 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states. [2018-01-21 00:32:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:12,224 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-01-21 00:32:12,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:32:12,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-01-21 00:32:12,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:12,228 INFO L225 Difference]: With dead ends: 83 [2018-01-21 00:32:12,228 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:32:12,229 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:32:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:32:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:32:12,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:32:12,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:32:12,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-01-21 00:32:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:12,231 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:32:12,231 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:32:12,231 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:32:12,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:32:12,234 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:12,235 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:12,235 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:12,235 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:12,235 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:12,235 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:12,235 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:12,235 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:32:12,235 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 00:32:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:32:12,238 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:12,239 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:32:12,239 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:32:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1051528599, now seen corresponding path program 1 times [2018-01-21 00:32:12,239 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:12,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,240 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:12,240 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,241 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:12,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:12,254 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:32:12,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:12,255 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:32:12,255 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:12,255 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:32:12,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:32:12,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:32:12,256 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-21 00:32:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:12,262 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-21 00:32:12,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:32:12,262 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 00:32:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:12,263 INFO L225 Difference]: With dead ends: 105 [2018-01-21 00:32:12,263 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 00:32:12,264 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:32:12,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 00:32:12,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-21 00:32:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 00:32:12,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-21 00:32:12,271 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2018-01-21 00:32:12,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:12,272 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-21 00:32:12,272 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:32:12,272 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-21 00:32:12,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 00:32:12,273 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:12,274 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] [2018-01-21 00:32:12,274 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:32:12,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2106609350, now seen corresponding path program 1 times [2018-01-21 00:32:12,274 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:12,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,275 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:12,275 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,275 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:12,291 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:12,412 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:32:12,413 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:12,413 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:32:12,413 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:12,413 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:32:12,414 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:32:12,414 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:32:12,414 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 8 states. [2018-01-21 00:32:12,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:12,560 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-01-21 00:32:12,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:32:12,561 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-21 00:32:12,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:12,562 INFO L225 Difference]: With dead ends: 89 [2018-01-21 00:32:12,562 INFO L226 Difference]: Without dead ends: 69 [2018-01-21 00:32:12,562 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-21 00:32:12,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-21 00:32:12,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-21 00:32:12,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 00:32:12,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-21 00:32:12,567 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 35 [2018-01-21 00:32:12,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:12,568 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-21 00:32:12,568 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:32:12,568 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-21 00:32:12,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 00:32:12,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:12,569 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:32:12,569 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:32:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1721987472, now seen corresponding path program 1 times [2018-01-21 00:32:12,570 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:12,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,570 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:12,570 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:32:12,591 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:32:12,701 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:32:12,701 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:32:12,701 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:32:12,701 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:32:12,702 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:32:12,702 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:32:12,702 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:32:12,703 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2018-01-21 00:32:12,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:32:12,747 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-21 00:32:12,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:32:12,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-21 00:32:12,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:32:12,754 INFO L225 Difference]: With dead ends: 81 [2018-01-21 00:32:12,754 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:32:12,755 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:32:12,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:32:12,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:32:12,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:32:12,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:32:12,756 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 00:32:12,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:32:12,756 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:32:12,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:32:12,756 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:32:12,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:32:12,758 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:32:12,758 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:32:12,758 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:32:12,759 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:32:12,759 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:32:12,759 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:32:12,759 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:32:12,759 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 00:32:12,759 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:32:12,761 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 00:32:12,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:32:12,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:32:12,762 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:32:12,762 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 00:32:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1137567503, now seen corresponding path program 1 times [2018-01-21 00:32:12,763 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:32:12,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:32:12,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:32:12,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:32:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:32:12,792 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:32:12,798 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:12,802 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:32:12,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:32:12 BoogieIcfgContainer [2018-01-21 00:32:12,816 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:32:12,817 INFO L168 Benchmark]: Toolchain (without parser) took 2315.64 ms. Allocated memory was 297.8 MB in the beginning and 475.5 MB in the end (delta: 177.7 MB). Free memory was 255.1 MB in the beginning and 424.6 MB in the end (delta: -169.4 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:32:12,819 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 297.8 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:32:12,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 205.58 ms. Allocated memory is still 297.8 MB. Free memory was 255.1 MB in the beginning and 245.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:32:12,819 INFO L168 Benchmark]: Boogie Preprocessor took 31.28 ms. Allocated memory is still 297.8 MB. Free memory was 245.2 MB in the beginning and 243.2 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:32:12,819 INFO L168 Benchmark]: RCFGBuilder took 301.49 ms. Allocated memory is still 297.8 MB. Free memory was 243.2 MB in the beginning and 220.5 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-21 00:32:12,820 INFO L168 Benchmark]: TraceAbstraction took 1770.55 ms. Allocated memory was 297.8 MB in the beginning and 475.5 MB in the end (delta: 177.7 MB). Free memory was 220.5 MB in the beginning and 424.6 MB in the end (delta: -204.0 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:32:12,821 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.14 ms. Allocated memory is still 297.8 MB. Free memory is still 261.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 205.58 ms. Allocated memory is still 297.8 MB. Free memory was 255.1 MB in the beginning and 245.2 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.28 ms. Allocated memory is still 297.8 MB. Free memory was 245.2 MB in the beginning and 243.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 301.49 ms. Allocated memory is still 297.8 MB. Free memory was 243.2 MB in the beginning and 220.5 MB in the end (delta: 22.7 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1770.55 ms. Allocated memory was 297.8 MB in the beginning and 475.5 MB in the end (delta: 177.7 MB). Free memory was 220.5 MB in the beginning and 424.6 MB in the end (delta: -204.0 MB). There was no memory consumed. 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) * 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 4 procedures, 68 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred 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 - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 72 SDslu, 188 SDs, 0 SdLazy, 140 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 17859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 633]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 72 SDslu, 180 SDs, 0 SdLazy, 140 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 16803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 624]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={11:0}] [L637] CALL append(&list) VAL [plist={11:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628] EXPR, FCALL item->next VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L631] FCALL *plist = item VAL [item={9:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. UNSAFE Result, 0.0s 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=68occurred 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, 23 NumberOfCodeBlocks, 23 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-32-12-830.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-32-12-830.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-32-12-830.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-32-12-830.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-32-12-830.csv Received shutdown request...