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_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:39:14,035 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:39:14,037 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:39:14,050 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:39:14,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:39:14,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:39:14,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:39:14,053 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:39:14,054 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:39:14,055 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:39:14,055 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:39:14,056 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:39:14,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:39:14,057 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:39:14,058 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:39:14,060 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:39:14,063 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:39:14,065 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:39:14,067 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:39:14,068 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:39:14,071 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:39:14,071 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:39:14,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:39:14,072 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:39:14,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:39:14,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:39:14,075 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:39:14,075 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:39:14,076 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:39:14,076 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:39:14,077 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:39:14,077 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_preciseopt.epf [2018-01-21 08:39:14,087 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:39:14,087 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:39:14,088 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:39:14,088 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:39:14,089 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:39:14,089 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:39:14,089 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:39:14,089 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:39:14,089 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:39:14,090 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:39:14,090 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:39:14,090 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:39:14,090 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:39:14,091 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:39:14,091 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:39:14,091 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:39:14,091 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:39:14,091 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:39:14,091 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:39:14,092 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:39:14,092 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:39:14,092 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:39:14,092 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:39:14,092 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:39:14,093 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:39:14,093 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:39:14,093 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:39:14,093 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:39:14,093 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:39:14,094 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:39:14,094 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:39:14,094 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:39:14,094 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:39:14,094 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:39:14,095 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:39:14,095 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:39:14,095 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:39:14,095 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:39:14,096 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:39:14,096 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:39:14,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:39:14,145 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:39:14,150 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:39:14,151 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:39:14,152 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:39:14,153 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_true-valid-memsafety_true-termination.i [2018-01-21 08:39:14,363 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:39:14,368 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:39:14,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:39:14,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:39:14,378 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:39:14,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b942210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14, skipping insertion in model container [2018-01-21 08:39:14,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,403 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:39:14,443 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:39:14,557 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:39:14,573 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:39:14,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14 WrapperNode [2018-01-21 08:39:14,579 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:39:14,579 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:39:14,580 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:39:14,580 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:39:14,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,603 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (1/1) ... [2018-01-21 08:39:14,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:39:14,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:39:14,614 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:39:14,614 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:39:14,615 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (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 08:39:14,660 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:39:14,661 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:39:14,661 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 08:39:14,661 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:39:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 08:39:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 08:39:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:39:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:39:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:39:14,661 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:39:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 08:39:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:39:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 08:39:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:39:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:39:14,662 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:39:14,908 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:39:14,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:39:14 BoogieIcfgContainer [2018-01-21 08:39:14,909 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:39:14,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:39:14,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:39:14,911 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:39:14,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:39:14" (1/3) ... [2018-01-21 08:39:14,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5e5437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:39:14, skipping insertion in model container [2018-01-21 08:39:14,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:39:14" (2/3) ... [2018-01-21 08:39:14,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5e5437 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:39:14, skipping insertion in model container [2018-01-21 08:39:14,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:39:14" (3/3) ... [2018-01-21 08:39:14,914 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_true-valid-memsafety_true-termination.i [2018-01-21 08:39:14,920 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:39:14,926 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 08:39:14,971 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:39:14,972 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:39:14,972 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:39:14,972 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:39:14,972 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:39:14,972 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:39:14,973 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:39:14,973 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:39:14,974 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:39:14,995 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:39:15,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:39:15,001 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:15,002 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:39:15,002 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:39:15,006 INFO L82 PathProgramCache]: Analyzing trace with hash 118205, now seen corresponding path program 1 times [2018-01-21 08:39:15,007 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:15,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:15,049 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:15,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:39:15,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:39:15,101 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:39:15,108 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:39:15,116 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:39:15,116 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:39:15,117 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:39:15,117 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:39:15,117 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:39:15,117 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:39:15,117 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:39:15,117 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:39:15,117 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:39:15,120 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:39:15,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 08:39:15,122 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:15,122 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 08:39:15,122 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:39:15,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1657082378, now seen corresponding path program 1 times [2018-01-21 08:39:15,123 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:15,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,124 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:15,124 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,125 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:39:15,147 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:39:15,185 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 08:39:15,187 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:39:15,187 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:39:15,187 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:39:15,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:39:15,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:39:15,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:39:15,208 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 08:39:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:39:15,305 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-21 08:39:15,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:39:15,306 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 08:39:15,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:39:15,314 INFO L225 Difference]: With dead ends: 97 [2018-01-21 08:39:15,314 INFO L226 Difference]: Without dead ends: 61 [2018-01-21 08:39:15,317 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 08:39:15,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-21 08:39:15,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-21 08:39:15,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 08:39:15,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-01-21 08:39:15,347 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 17 [2018-01-21 08:39:15,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:39:15,347 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-01-21 08:39:15,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:39:15,348 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-01-21 08:39:15,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 08:39:15,349 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:15,349 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 08:39:15,349 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:39:15,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1284274074, now seen corresponding path program 1 times [2018-01-21 08:39:15,349 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:15,350 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:15,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,351 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:15,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:39:15,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:39:15,464 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 08:39:15,464 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:39:15,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:39:15,465 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:39:15,467 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:39:15,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:39:15,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:39:15,467 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 4 states. [2018-01-21 08:39:15,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:39:15,525 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2018-01-21 08:39:15,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:39:15,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-01-21 08:39:15,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:39:15,528 INFO L225 Difference]: With dead ends: 81 [2018-01-21 08:39:15,529 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 08:39:15,530 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-21 08:39:15,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 08:39:15,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-01-21 08:39:15,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-21 08:39:15,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2018-01-21 08:39:15,543 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 37 [2018-01-21 08:39:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:39:15,544 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2018-01-21 08:39:15,544 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:39:15,544 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2018-01-21 08:39:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-01-21 08:39:15,546 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:15,546 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:39:15,546 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:39:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1067134254, now seen corresponding path program 1 times [2018-01-21 08:39:15,546 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:15,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,548 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:15,548 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,548 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:39:15,584 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:39:15,742 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 08:39:15,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:39:15,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 08:39:15,742 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:39:15,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 08:39:15,743 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 08:39:15,743 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:39:15,744 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 6 states. [2018-01-21 08:39:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:39:15,794 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2018-01-21 08:39:15,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:39:15,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2018-01-21 08:39:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:39:15,795 INFO L225 Difference]: With dead ends: 80 [2018-01-21 08:39:15,795 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:39:15,796 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:39:15,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:39:15,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:39:15,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:39:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:39:15,796 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2018-01-21 08:39:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:39:15,797 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:39:15,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 08:39:15,797 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:39:15,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:39:15,799 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:39:15,799 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:39:15,799 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:39:15,800 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:39:15,800 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:39:15,800 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:39:15,800 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:39:15,800 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:39:15,800 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:39:15,801 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:39:15,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 08:39:15,802 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:15,802 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:39:15,802 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:39:15,802 INFO L82 PathProgramCache]: Analyzing trace with hash -901067964, now seen corresponding path program 1 times [2018-01-21 08:39:15,802 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:15,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:15,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,804 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:39:15,810 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:39:15,819 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 08:39:15,820 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:39:15,820 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:39:15,820 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:39:15,821 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:39:15,821 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:39:15,821 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:39:15,821 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 08:39:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:39:15,827 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2018-01-21 08:39:15,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:39:15,827 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 08:39:15,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:39:15,828 INFO L225 Difference]: With dead ends: 97 [2018-01-21 08:39:15,828 INFO L226 Difference]: Without dead ends: 59 [2018-01-21 08:39:15,829 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 08:39:15,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-21 08:39:15,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-21 08:39:15,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 08:39:15,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-21 08:39:15,836 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 15 [2018-01-21 08:39:15,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:39:15,836 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-21 08:39:15,836 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:39:15,836 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-21 08:39:15,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 08:39:15,837 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:15,838 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 08:39:15,838 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 08:39:15,838 INFO L82 PathProgramCache]: Analyzing trace with hash -959556396, now seen corresponding path program 1 times [2018-01-21 08:39:15,838 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:15,839 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,840 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:15,840 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,840 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:39:15,858 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:39:15,906 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 08:39:15,906 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:39:15,906 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 08:39:15,906 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:39:15,907 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 08:39:15,907 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 08:39:15,907 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 08:39:15,907 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 4 states. [2018-01-21 08:39:15,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:39:15,929 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-01-21 08:39:15,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 08:39:15,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-21 08:39:15,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:39:15,931 INFO L225 Difference]: With dead ends: 77 [2018-01-21 08:39:15,931 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 08:39:15,932 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-21 08:39:15,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 08:39:15,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2018-01-21 08:39:15,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-21 08:39:15,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2018-01-21 08:39:15,936 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 35 [2018-01-21 08:39:15,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:39:15,936 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2018-01-21 08:39:15,936 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 08:39:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2018-01-21 08:39:15,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-21 08:39:15,937 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:15,938 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:39:15,938 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 08:39:15,938 INFO L82 PathProgramCache]: Analyzing trace with hash 754195980, now seen corresponding path program 1 times [2018-01-21 08:39:15,938 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:15,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,939 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:15,939 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:15,939 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:39:15,960 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:39:16,133 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 08:39:16,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:39:16,133 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 08:39:16,133 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:39:16,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 08:39:16,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 08:39:16,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:39:16,134 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand 6 states. [2018-01-21 08:39:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:39:16,223 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-01-21 08:39:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:39:16,224 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-21 08:39:16,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:39:16,224 INFO L225 Difference]: With dead ends: 78 [2018-01-21 08:39:16,224 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:39:16,225 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:39:16,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:39:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:39:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:39:16,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:39:16,226 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2018-01-21 08:39:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:39:16,227 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:39:16,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 08:39:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:39:16,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:39:16,231 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:39:16,231 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:39:16,231 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:39:16,232 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:39:16,232 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:39:16,232 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:39:16,232 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:39:16,232 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 08:39:16,232 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:39:16,234 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 08:39:16,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 08:39:16,235 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:39:16,236 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-21 08:39:16,236 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 08:39:16,236 INFO L82 PathProgramCache]: Analyzing trace with hash -958748531, now seen corresponding path program 1 times [2018-01-21 08:39:16,236 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:39:16,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:16,237 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:39:16,237 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:39:16,238 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:39:16,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:39:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:39:16,271 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:39:16,278 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:39:16,283 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:39:16,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:39:16 BoogieIcfgContainer [2018-01-21 08:39:16,297 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:39:16,298 INFO L168 Benchmark]: Toolchain (without parser) took 1934.09 ms. Allocated memory was 302.5 MB in the beginning and 458.2 MB in the end (delta: 155.7 MB). Free memory was 259.7 MB in the beginning and 335.9 MB in the end (delta: -76.3 MB). Peak memory consumption was 79.4 MB. Max. memory is 5.3 GB. [2018-01-21 08:39:16,299 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.5 MB. Free memory is still 265.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:39:16,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.63 ms. Allocated memory is still 302.5 MB. Free memory was 259.7 MB in the beginning and 249.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:39:16,300 INFO L168 Benchmark]: Boogie Preprocessor took 33.73 ms. Allocated memory is still 302.5 MB. Free memory was 249.6 MB in the beginning and 247.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 08:39:16,300 INFO L168 Benchmark]: RCFGBuilder took 295.19 ms. Allocated memory is still 302.5 MB. Free memory was 247.6 MB in the beginning and 224.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-21 08:39:16,301 INFO L168 Benchmark]: TraceAbstraction took 1387.82 ms. Allocated memory was 302.5 MB in the beginning and 458.2 MB in the end (delta: 155.7 MB). Free memory was 224.7 MB in the beginning and 335.9 MB in the end (delta: -111.2 MB). Peak memory consumption was 44.5 MB. Max. memory is 5.3 GB. [2018-01-21 08:39:16,302 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.21 ms. Allocated memory is still 302.5 MB. Free memory is still 265.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.63 ms. Allocated memory is still 302.5 MB. Free memory was 259.7 MB in the beginning and 249.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.73 ms. Allocated memory is still 302.5 MB. Free memory was 249.6 MB in the beginning and 247.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 295.19 ms. Allocated memory is still 302.5 MB. Free memory was 247.6 MB in the beginning and 224.7 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1387.82 ms. Allocated memory was 302.5 MB in the beginning and 458.2 MB in the end (delta: 155.7 MB). Free memory was 224.7 MB in the beginning and 335.9 MB in the end (delta: -111.2 MB). Peak memory consumption was 44.5 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, 65 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=65occurred 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, 65 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, 38 SDslu, 113 SDs, 0 SdLazy, 48 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 100 ConstructedInterpolants, 0 QuantifiedInterpolants, 13360 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, 65 locations, 4 error locations. SAFE Result, 0.4s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 38 SDslu, 109 SDs, 0 SdLazy, 48 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred 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, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 12570 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, 65 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=65occurred 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_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-39-16-313.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-39-16-313.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-39-16-313.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-39-16-313.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_1_true-valid-memsafety_true-termination.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-39-16-313.csv Received shutdown request...