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-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:33:34,456 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:33:34,458 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:33:34,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:33:34,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:33:34,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:33:34,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:33:34,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:33:34,475 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:33:34,476 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:33:34,477 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:33:34,477 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:33:34,478 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:33:34,479 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:33:34,480 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:33:34,483 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:33:34,485 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:33:34,487 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:33:34,488 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:33:34,489 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:33:34,491 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:33:34,492 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:33:34,492 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:33:34,493 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:33:34,493 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:33:34,495 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:33:34,495 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:33:34,496 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:33:34,496 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:33:34,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:33:34,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:33:34,497 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:33:34,507 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:33:34,507 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:33:34,508 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:33:34,508 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:33:34,508 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:33:34,508 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:33:34,509 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:33:34,509 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:33:34,509 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:33:34,510 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:33:34,510 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:33:34,510 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:33:34,510 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:33:34,510 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:33:34,511 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:33:34,511 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:33:34,511 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:33:34,511 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:33:34,511 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:33:34,511 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:33:34,512 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:33:34,512 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:33:34,512 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:33:34,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:33:34,512 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:33:34,513 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:33:34,513 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:33:34,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:33:34,513 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:33:34,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:33:34,514 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:33:34,514 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:33:34,514 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:33:34,514 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:33:34,514 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:33:34,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:33:34,515 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:33:34,516 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:33:34,516 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:33:34,550 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:33:34,563 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:33:34,567 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:33:34,569 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:33:34,569 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:33:34,570 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-memtrack.i [2018-01-21 00:33:34,747 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:33:34,750 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:33:34,751 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:33:34,751 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:33:34,757 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:33:34,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41741684 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34, skipping insertion in model container [2018-01-21 00:33:34,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,775 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:33:34,813 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:33:34,930 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:33:34,949 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:33:34,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34 WrapperNode [2018-01-21 00:33:34,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:33:34,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:33:34,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:33:34,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:33:34,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,986 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (1/1) ... [2018-01-21 00:33:34,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:33:34,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:33:34,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:33:34,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:33:34,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (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:33:35,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:33:35,039 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:33:35,040 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 00:33:35,040 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:33:35,040 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:33:35,040 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:33:35,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:33:35,040 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:33:35,040 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:33:35,041 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:33:35,041 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:33:35,041 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:33:35,041 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 00:33:35,041 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:33:35,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:33:35,042 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:33:35,285 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:33:35,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:33:35 BoogieIcfgContainer [2018-01-21 00:33:35,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:33:35,287 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:33:35,287 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:33:35,290 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:33:35,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:33:34" (1/3) ... [2018-01-21 00:33:35,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:33:35, skipping insertion in model container [2018-01-21 00:33:35,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:33:34" (2/3) ... [2018-01-21 00:33:35,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b13776c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:33:35, skipping insertion in model container [2018-01-21 00:33:35,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:33:35" (3/3) ... [2018-01-21 00:33:35,294 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-memtrack.i [2018-01-21 00:33:35,304 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:33:35,312 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 00:33:35,354 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:35,354 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:35,354 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:35,354 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:35,354 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:35,354 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:35,355 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:35,355 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:33:35,356 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:35,375 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 00:33:35,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 00:33:35,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:35,382 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 00:33:35,382 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:33:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash 112439, now seen corresponding path program 1 times [2018-01-21 00:33:35,388 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:35,432 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:35,433 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:35,433 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:35,433 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:33:35,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:33:35,489 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:33:35,495 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:33:35,502 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:35,503 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:35,503 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:35,503 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:35,503 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:35,503 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:35,503 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:35,503 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:33:35,503 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:35,506 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 00:33:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 00:33:35,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:35,508 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:33:35,508 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:33:35,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1291770077, now seen corresponding path program 1 times [2018-01-21 00:33:35,508 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:35,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:35,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:35,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:35,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:35,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:35,531 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:35,569 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:33:35,570 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:35,571 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:35,571 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:35,573 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:35,584 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:35,584 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:35,587 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-21 00:33:35,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:35,609 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-21 00:33:35,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:35,694 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 00:33:35,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:35,705 INFO L225 Difference]: With dead ends: 87 [2018-01-21 00:33:35,705 INFO L226 Difference]: Without dead ends: 55 [2018-01-21 00:33:35,708 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:33:35,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-21 00:33:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-21 00:33:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 00:33:35,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-21 00:33:35,744 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 17 [2018-01-21 00:33:35,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:35,745 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-21 00:33:35,745 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-21 00:33:35,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 00:33:35,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:35,746 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:33:35,746 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:33:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash -348822780, now seen corresponding path program 1 times [2018-01-21 00:33:35,747 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:35,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:35,748 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:35,748 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:35,748 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:35,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:35,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:35,988 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:33:35,988 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:35,988 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:33:35,988 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:35,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:33:35,991 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:33:35,991 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:33:35,991 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 8 states. [2018-01-21 00:33:36,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:36,273 INFO L93 Difference]: Finished difference Result 79 states and 83 transitions. [2018-01-21 00:33:36,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:33:36,274 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-21 00:33:36,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:36,278 INFO L225 Difference]: With dead ends: 79 [2018-01-21 00:33:36,278 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 00:33:36,279 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:33:36,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 00:33:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2018-01-21 00:33:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-21 00:33:36,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 57 transitions. [2018-01-21 00:33:36,291 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 57 transitions. Word has length 37 [2018-01-21 00:33:36,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:36,292 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 57 transitions. [2018-01-21 00:33:36,292 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:33:36,292 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 57 transitions. [2018-01-21 00:33:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-01-21 00:33:36,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:36,294 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-21 00:33:36,294 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:33:36,294 INFO L82 PathProgramCache]: Analyzing trace with hash -66466680, now seen corresponding path program 1 times [2018-01-21 00:33:36,295 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:36,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:36,296 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:36,296 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:36,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:36,323 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:36,536 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:33:36,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:36,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-21 00:33:36,537 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:36,537 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 00:33:36,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 00:33:36,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-21 00:33:36,539 INFO L87 Difference]: Start difference. First operand 55 states and 57 transitions. Second operand 12 states. [2018-01-21 00:33:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:36,838 INFO L93 Difference]: Finished difference Result 62 states and 65 transitions. [2018-01-21 00:33:36,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 00:33:36,838 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 44 [2018-01-21 00:33:36,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:36,838 INFO L225 Difference]: With dead ends: 62 [2018-01-21 00:33:36,839 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:36,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-21 00:33:36,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:36,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:36,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:36,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:36,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2018-01-21 00:33:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:36,840 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:36,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 00:33:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:36,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:36,844 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:36,844 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:36,844 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:36,844 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:36,844 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:36,844 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:36,845 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:36,845 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:33:36,845 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:36,846 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 00:33:36,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 00:33:36,848 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:36,848 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:33:36,848 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:33:36,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1065030161, now seen corresponding path program 1 times [2018-01-21 00:33:36,849 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:36,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:36,854 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:36,854 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:36,854 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:36,860 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:36,869 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:33:36,869 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:36,870 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 00:33:36,870 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:36,870 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 00:33:36,870 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 00:33:36,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 00:33:36,871 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 2 states. [2018-01-21 00:33:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:36,876 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2018-01-21 00:33:36,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 00:33:36,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 00:33:36,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:36,878 INFO L225 Difference]: With dead ends: 87 [2018-01-21 00:33:36,878 INFO L226 Difference]: Without dead ends: 53 [2018-01-21 00:33:36,878 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:33:36,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-21 00:33:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-21 00:33:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-21 00:33:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-01-21 00:33:36,884 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 15 [2018-01-21 00:33:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:36,885 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-01-21 00:33:36,885 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 00:33:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-01-21 00:33:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 00:33:36,886 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:36,886 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:33:36,886 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 00:33:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1313602040, now seen corresponding path program 1 times [2018-01-21 00:33:36,887 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:36,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:36,888 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:36,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:36,888 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:36,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:36,904 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:37,089 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:33:37,089 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:37,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 00:33:37,090 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:37,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 00:33:37,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 00:33:37,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 00:33:37,091 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 8 states. [2018-01-21 00:33:37,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:37,246 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-01-21 00:33:37,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 00:33:37,246 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-21 00:33:37,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:37,247 INFO L225 Difference]: With dead ends: 75 [2018-01-21 00:33:37,248 INFO L226 Difference]: Without dead ends: 60 [2018-01-21 00:33:37,248 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:33:37,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-21 00:33:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-01-21 00:33:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-21 00:33:37,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2018-01-21 00:33:37,254 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 35 [2018-01-21 00:33:37,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:37,255 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2018-01-21 00:33:37,255 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 00:33:37,255 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2018-01-21 00:33:37,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-21 00:33:37,256 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:37,256 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] [2018-01-21 00:33:37,256 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 00:33:37,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2055932804, now seen corresponding path program 1 times [2018-01-21 00:33:37,257 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:37,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:37,258 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:37,258 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:37,258 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:37,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:33:37,274 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:33:37,440 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:33:37,440 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:33:37,440 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-01-21 00:33:37,440 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:33:37,441 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-21 00:33:37,441 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-21 00:33:37,441 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-01-21 00:33:37,441 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 12 states. [2018-01-21 00:33:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:33:37,663 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2018-01-21 00:33:37,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-21 00:33:37,664 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-01-21 00:33:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:33:37,664 INFO L225 Difference]: With dead ends: 60 [2018-01-21 00:33:37,664 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:33:37,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2018-01-21 00:33:37,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:33:37,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:33:37,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:33:37,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:33:37,666 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-01-21 00:33:37,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:33:37,666 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:33:37,666 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-21 00:33:37,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:33:37,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:33:37,667 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:33:37,667 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:33:37,667 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:33:37,667 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:33:37,668 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:33:37,668 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:33:37,668 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:33:37,668 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 00:33:37,668 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:33:37,669 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-01-21 00:33:37,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:33:37,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:33:37,670 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:33:37,670 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 00:33:37,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1066206763, now seen corresponding path program 1 times [2018-01-21 00:33:37,671 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:33:37,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:37,672 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:33:37,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:33:37,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:33:37,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:33:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:33:37,701 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:33:37,707 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:33:37,712 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:33:37,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:33:37 BoogieIcfgContainer [2018-01-21 00:33:37,722 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:33:37,723 INFO L168 Benchmark]: Toolchain (without parser) took 2975.89 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 262.9 MB in the beginning and 325.8 MB in the end (delta: -62.9 MB). Peak memory consumption was 112.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:37,725 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:33:37,725 INFO L168 Benchmark]: CACSL2BoogieTranslator took 206.34 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 251.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:37,725 INFO L168 Benchmark]: Boogie Preprocessor took 32.53 ms. Allocated memory is still 304.6 MB. Free memory was 251.9 MB in the beginning and 249.9 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:33:37,725 INFO L168 Benchmark]: RCFGBuilder took 295.81 ms. Allocated memory is still 304.6 MB. Free memory was 249.9 MB in the beginning and 229.3 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:37,726 INFO L168 Benchmark]: TraceAbstraction took 2435.26 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 229.3 MB in the beginning and 325.8 MB in the end (delta: -96.5 MB). Peak memory consumption was 79.1 MB. Max. memory is 5.3 GB. [2018-01-21 00:33:37,728 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 304.6 MB. Free memory is still 268.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 206.34 ms. Allocated memory is still 304.6 MB. Free memory was 261.9 MB in the beginning and 251.9 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.53 ms. Allocated memory is still 304.6 MB. Free memory was 251.9 MB in the beginning and 249.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.81 ms. Allocated memory is still 304.6 MB. Free memory was 249.9 MB in the beginning and 229.3 MB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2435.26 ms. Allocated memory was 304.6 MB in the beginning and 480.2 MB in the end (delta: 175.6 MB). Free memory was 229.3 MB in the beginning and 325.8 MB in the end (delta: -96.5 MB). Peak memory consumption was 79.1 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 59 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=59occurred 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, 59 locations, 4 error locations. SAFE Result, 1.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 130 SDtfs, 88 SDslu, 238 SDs, 0 SdLazy, 292 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.4s InterpolantComputationTime, 98 NumberOfCodeBlocks, 98 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 22404 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, 59 locations, 4 error locations. SAFE Result, 0.8s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 88 SDslu, 230 SDs, 0 SdLazy, 292 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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, 92 NumberOfCodeBlocks, 92 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 21102 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)={13:0}, malloc(sizeof *item)={9: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)={13:0}, malloc(sizeof *item)={9: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)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L631] FCALL *plist = item VAL [item={9:0}, malloc(sizeof *item)={13:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 59 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=59occurred 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-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-33-37-738.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-33-37-738.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-33-37-738.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-33-37-738.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-33-37-738.csv Received shutdown request...