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/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:43:53,183 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:43:53,185 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:43:53,199 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:43:53,200 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:43:53,201 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:43:53,202 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:43:53,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:43:53,205 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:43:53,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:43:53,207 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:43:53,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:43:53,208 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:43:53,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:43:53,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:43:53,213 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:43:53,215 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:43:53,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:43:53,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:43:53,220 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:43:53,222 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:43:53,222 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:43:53,222 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:43:53,223 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:43:53,224 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:43:53,226 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:43:53,226 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:43:53,227 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:43:53,227 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:43:53,227 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:43:53,228 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:43:53,228 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-20 23:43:53,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:43:53,238 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:43:53,238 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:43:53,239 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:43:53,239 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:43:53,239 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:43:53,239 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:43:53,239 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:43:53,240 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:43:53,240 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:43:53,240 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:43:53,240 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:43:53,240 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:43:53,240 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:43:53,241 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:43:53,241 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:43:53,241 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:43:53,241 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:43:53,241 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:43:53,241 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:43:53,241 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:43:53,242 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:43:53,242 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:43:53,242 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:43:53,242 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:43:53,242 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:43:53,243 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:43:53,243 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:43:53,244 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:43:53,244 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:43:53,244 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:43:53,279 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:43:53,289 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:43:53,293 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:43:53,294 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:43:53,294 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:43:53,295 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-01-20 23:43:53,464 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:43:53,468 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:43:53,469 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:43:53,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:43:53,474 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:43:53,475 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6479bd29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53, skipping insertion in model container [2018-01-20 23:43:53,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,491 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:43:53,528 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:43:53,651 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:43:53,670 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:43:53,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53 WrapperNode [2018-01-20 23:43:53,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:43:53,678 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:43:53,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:43:53,679 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:43:53,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (1/1) ... [2018-01-20 23:43:53,721 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:43:53,722 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:43:53,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:43:53,722 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:43:53,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (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-20 23:43:53,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:43:53,789 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:43:53,789 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-20 23:43:53,789 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:43:53,790 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-20 23:43:53,790 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-20 23:43:53,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:43:53,790 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:43:53,790 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:43:53,790 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:43:53,791 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:43:53,791 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-20 23:43:53,791 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-20 23:43:53,791 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:43:53,791 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:43:53,791 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:43:54,072 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:43:54,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:43:54 BoogieIcfgContainer [2018-01-20 23:43:54,073 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:43:54,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:43:54,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:43:54,075 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:43:54,075 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:43:53" (1/3) ... [2018-01-20 23:43:54,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57569fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:43:54, skipping insertion in model container [2018-01-20 23:43:54,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:43:53" (2/3) ... [2018-01-20 23:43:54,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57569fe6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:43:54, skipping insertion in model container [2018-01-20 23:43:54,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:43:54" (3/3) ... [2018-01-20 23:43:54,078 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-01-20 23:43:54,085 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:43:54,091 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 23:43:54,131 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:43:54,131 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:43:54,131 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:43:54,131 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:43:54,131 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:43:54,132 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:43:54,132 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:43:54,132 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:43:54,133 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:43:54,156 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:43:54,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:43:54,162 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:54,163 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:43:54,164 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:43:54,169 INFO L82 PathProgramCache]: Analyzing trace with hash 123971, now seen corresponding path program 1 times [2018-01-20 23:43:54,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:54,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,214 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:54,214 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,214 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:43:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:43:54,272 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:43:54,279 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:43:54,287 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:43:54,287 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:43:54,288 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:43:54,288 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:43:54,288 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:43:54,288 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:43:54,288 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:43:54,288 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:43:54,288 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:43:54,291 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:43:54,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-20 23:43:54,293 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:54,293 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:43:54,294 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:43:54,294 INFO L82 PathProgramCache]: Analyzing trace with hash -532280886, now seen corresponding path program 1 times [2018-01-20 23:43:54,294 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:54,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:54,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:43:54,319 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:43:54,357 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-20 23:43:54,359 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:43:54,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:43:54,360 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:43:54,362 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:43:54,444 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:43:54,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:43:54,448 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-20 23:43:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:43:54,468 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-01-20 23:43:54,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:43:54,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-20 23:43:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:43:54,481 INFO L225 Difference]: With dead ends: 99 [2018-01-20 23:43:54,481 INFO L226 Difference]: Without dead ends: 62 [2018-01-20 23:43:54,484 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-20 23:43:54,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-20 23:43:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-20 23:43:54,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-20 23:43:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-20 23:43:54,515 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 17 [2018-01-20 23:43:54,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:43:54,515 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-20 23:43:54,515 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:43:54,515 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-20 23:43:54,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-20 23:43:54,516 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:54,516 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-20 23:43:54,516 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:43:54,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1810255776, now seen corresponding path program 1 times [2018-01-20 23:43:54,517 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:54,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,518 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:54,518 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,518 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:43:54,557 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:43:54,638 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-20 23:43:54,638 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:43:54,638 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:43:54,638 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:43:54,640 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:43:54,641 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:43:54,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:43:54,641 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 4 states. [2018-01-20 23:43:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:43:54,717 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-20 23:43:54,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:43:54,718 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-20 23:43:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:43:54,720 INFO L225 Difference]: With dead ends: 90 [2018-01-20 23:43:54,720 INFO L226 Difference]: Without dead ends: 61 [2018-01-20 23:43:54,722 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:43:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-20 23:43:54,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-01-20 23:43:54,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-20 23:43:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2018-01-20 23:43:54,735 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 37 [2018-01-20 23:43:54,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:43:54,735 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2018-01-20 23:43:54,735 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:43:54,736 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2018-01-20 23:43:54,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-20 23:43:54,737 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:54,737 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-20 23:43:54,738 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:43:54,738 INFO L82 PathProgramCache]: Analyzing trace with hash 60106891, now seen corresponding path program 1 times [2018-01-20 23:43:54,738 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:54,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,739 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:54,739 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:54,739 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:43:54,769 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:43:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-20 23:43:55,000 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:43:55,000 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-20 23:43:55,000 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:43:55,000 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 23:43:55,001 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 23:43:55,001 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:43:55,001 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand 10 states. [2018-01-20 23:43:55,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:43:55,366 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-01-20 23:43:55,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 23:43:55,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-01-20 23:43:55,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:43:55,367 INFO L225 Difference]: With dead ends: 65 [2018-01-20 23:43:55,367 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:43:55,369 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-01-20 23:43:55,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:43:55,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:43:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:43:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:43:55,370 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-20 23:43:55,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:43:55,371 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:43:55,372 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 23:43:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:43:55,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:43:55,377 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:43:55,378 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:43:55,378 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:43:55,378 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:43:55,378 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:43:55,378 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:43:55,378 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:43:55,378 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:43:55,379 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:43:55,380 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:43:55,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-20 23:43:55,384 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:55,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-20 23:43:55,384 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:43:55,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1685468214, now seen corresponding path program 1 times [2018-01-20 23:43:55,384 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:55,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:55,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,385 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:55,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:43:55,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:43:55,399 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-20 23:43:55,399 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:43:55,399 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:43:55,400 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:43:55,400 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:43:55,400 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:43:55,400 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:43:55,400 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2018-01-20 23:43:55,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:43:55,404 INFO L93 Difference]: Finished difference Result 99 states and 108 transitions. [2018-01-20 23:43:55,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:43:55,404 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-20 23:43:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:43:55,405 INFO L225 Difference]: With dead ends: 99 [2018-01-20 23:43:55,405 INFO L226 Difference]: Without dead ends: 60 [2018-01-20 23:43:55,405 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-20 23:43:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-20 23:43:55,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-20 23:43:55,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-20 23:43:55,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-20 23:43:55,410 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 15 [2018-01-20 23:43:55,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:43:55,411 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-20 23:43:55,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:43:55,411 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-20 23:43:55,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-20 23:43:55,412 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:55,412 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-20 23:43:55,412 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:43:55,412 INFO L82 PathProgramCache]: Analyzing trace with hash 337780704, now seen corresponding path program 1 times [2018-01-20 23:43:55,412 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:55,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,413 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:55,413 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,413 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:43:55,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:43:55,472 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-20 23:43:55,472 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:43:55,472 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-20 23:43:55,473 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:43:55,473 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-20 23:43:55,473 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-20 23:43:55,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:43:55,474 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 4 states. [2018-01-20 23:43:55,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:43:55,509 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-20 23:43:55,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-20 23:43:55,509 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-20 23:43:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:43:55,510 INFO L225 Difference]: With dead ends: 86 [2018-01-20 23:43:55,511 INFO L226 Difference]: Without dead ends: 59 [2018-01-20 23:43:55,511 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-20 23:43:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-20 23:43:55,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-01-20 23:43:55,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-20 23:43:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2018-01-20 23:43:55,516 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 35 [2018-01-20 23:43:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:43:55,516 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2018-01-20 23:43:55,516 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-20 23:43:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2018-01-20 23:43:55,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-20 23:43:55,517 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:55,518 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] [2018-01-20 23:43:55,518 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:43:55,518 INFO L82 PathProgramCache]: Analyzing trace with hash -303847733, now seen corresponding path program 1 times [2018-01-20 23:43:55,518 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:55,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,519 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:55,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,519 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:43:55,538 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:43:55,728 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-20 23:43:55,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:43:55,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-20 23:43:55,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:43:55,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-20 23:43:55,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-20 23:43:55,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-01-20 23:43:55,729 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 10 states. [2018-01-20 23:43:55,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:43:55,981 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2018-01-20 23:43:55,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-20 23:43:55,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-01-20 23:43:55,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:43:55,982 INFO L225 Difference]: With dead ends: 63 [2018-01-20 23:43:55,982 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:43:55,983 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-01-20 23:43:55,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:43:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:43:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:43:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:43:55,984 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-20 23:43:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:43:55,984 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:43:55,984 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-20 23:43:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:43:55,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:43:55,986 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:43:55,987 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:43:55,987 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:43:55,987 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:43:55,987 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:43:55,987 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:43:55,987 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:43:55,988 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-20 23:43:55,988 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:43:55,989 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2018-01-20 23:43:55,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-20 23:43:55,991 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:43:55,991 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] [2018-01-20 23:43:55,991 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-20 23:43:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash -70755379, now seen corresponding path program 1 times [2018-01-20 23:43:55,992 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:43:55,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,993 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:43:55,993 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:43:55,993 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:43:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:43:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:43:56,032 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:43:56,038 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:43:56,043 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:43:56,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:43:56 BoogieIcfgContainer [2018-01-20 23:43:56,056 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:43:56,057 INFO L168 Benchmark]: Toolchain (without parser) took 2592.24 ms. Allocated memory was 299.9 MB in the beginning and 474.0 MB in the end (delta: 174.1 MB). Free memory was 258.2 MB in the beginning and 380.2 MB in the end (delta: -122.0 MB). Peak memory consumption was 52.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:43:56,059 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 299.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:43:56,059 INFO L168 Benchmark]: CACSL2BoogieTranslator took 208.95 ms. Allocated memory is still 299.9 MB. Free memory was 257.2 MB in the beginning and 247.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:43:56,059 INFO L168 Benchmark]: Boogie Preprocessor took 43.00 ms. Allocated memory is still 299.9 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:43:56,059 INFO L168 Benchmark]: RCFGBuilder took 350.83 ms. Allocated memory is still 299.9 MB. Free memory was 245.2 MB in the beginning and 223.3 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. [2018-01-20 23:43:56,060 INFO L168 Benchmark]: TraceAbstraction took 1982.83 ms. Allocated memory was 299.9 MB in the beginning and 474.0 MB in the end (delta: 174.1 MB). Free memory was 223.3 MB in the beginning and 380.2 MB in the end (delta: -156.8 MB). Peak memory consumption was 17.2 MB. Max. memory is 5.3 GB. [2018-01-20 23:43:56,062 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.15 ms. Allocated memory is still 299.9 MB. Free memory is still 264.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 208.95 ms. Allocated memory is still 299.9 MB. Free memory was 257.2 MB in the beginning and 247.2 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 43.00 ms. Allocated memory is still 299.9 MB. Free memory was 247.2 MB in the beginning and 245.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 350.83 ms. Allocated memory is still 299.9 MB. Free memory was 245.2 MB in the beginning and 223.3 MB in the end (delta: 21.8 MB). Peak memory consumption was 21.8 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1982.83 ms. Allocated memory was 299.9 MB in the beginning and 474.0 MB in the end (delta: 174.1 MB). Free memory was 223.3 MB in the beginning and 380.2 MB in the end (delta: -156.8 MB). Peak memory consumption was 17.2 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) * 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: [L620] int c = 0; VAL [\old(c)=2, c=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 66 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 66 locations, 4 error locations. SAFE Result, 1.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 154 SDtfs, 49 SDslu, 185 SDs, 0 SdLazy, 171 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 100 NumberOfCodeBlocks, 100 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 21244 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: 635]: 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, 66 locations, 4 error locations. SAFE Result, 0.6s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 152 SDtfs, 49 SDslu, 181 SDs, 0 SdLazy, 171 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred 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, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 94 NumberOfCodeBlocks, 94 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 20078 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: 625]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L620] int c = 0; VAL [\old(c)=0, c=0] [L637] FCALL struct item *list = ((void *)0); VAL [\old(c)=0, c=0, list={9:0}] [L638] int length = 0; VAL [\old(c)=0, c=0, length=0, list={9:0}] [L640] CALL append(&list) VAL [\old(c)=0, c=0, plist={9:0}] [L627] c++ VAL [\old(c)=0, c=1, plist={9:0}, plist={9:0}] [L628] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L628] struct item *item = malloc(sizeof *item); VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] EXPR, FCALL \read(**plist) VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L629] FCALL item->next = *plist VAL [\old(c)=0, \read(**plist)={0:0}, c=1, item={11:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630] EXPR, FCALL item->next VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L632] EXPR, FCALL malloc(sizeof *item) VAL [\old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L630-L632] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={12:0}, \old(c)=0, c=1, item={11:0}, item->next={0:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] [L633] FCALL *plist = item VAL [\old(c)=0, c=1, item={11:0}, malloc(sizeof *item)={12:0}, malloc(sizeof *item)={11:0}, plist={9:0}, plist={9:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 66 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=66occurred 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, 24 NumberOfCodeBlocks, 24 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_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-43-56-071.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-43-56-071.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-43-56-071.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-43-56-071.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_false-valid-memtrack_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-43-56-071.csv Received shutdown request...