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/memsafety/test-0232_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 08:19:41,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 08:19:41,936 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 08:19:41,952 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 08:19:41,953 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 08:19:41,954 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 08:19:41,955 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 08:19:41,956 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 08:19:41,958 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 08:19:41,959 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 08:19:41,960 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 08:19:41,960 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 08:19:41,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 08:19:41,962 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 08:19:41,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 08:19:41,966 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 08:19:41,968 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 08:19:41,970 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 08:19:41,972 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 08:19:41,973 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 08:19:41,975 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 08:19:41,976 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 08:19:41,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 08:19:41,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 08:19:41,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 08:19:41,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 08:19:41,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 08:19:41,980 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 08:19:41,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 08:19:41,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 08:19:41,981 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 08:19:41,982 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:19:41,990 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 08:19:41,990 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 08:19:41,991 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 08:19:41,991 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 08:19:41,991 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 08:19:41,992 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 08:19:41,992 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-21 08:19:41,992 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 08:19:41,992 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 08:19:41,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 08:19:41,993 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 08:19:41,993 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 08:19:41,993 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 08:19:41,993 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 08:19:41,993 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 08:19:41,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 08:19:41,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 08:19:41,994 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 08:19:41,994 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 08:19:41,994 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 08:19:41,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 08:19:41,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 08:19:41,994 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 08:19:41,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 08:19:41,995 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 08:19:41,995 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 08:19:41,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 08:19:41,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 08:19:41,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 08:19:41,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 08:19:41,997 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 08:19:41,997 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 08:19:42,029 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 08:19:42,040 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 08:19:42,043 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 08:19:42,044 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 08:19:42,044 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 08:19:42,045 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0232_false-valid-free.i [2018-01-21 08:19:42,202 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 08:19:42,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 08:19:42,207 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 08:19:42,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 08:19:42,213 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 08:19:42,214 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65848b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42, skipping insertion in model container [2018-01-21 08:19:42,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,230 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:19:42,268 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 08:19:42,390 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:19:42,409 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 08:19:42,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42 WrapperNode [2018-01-21 08:19:42,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 08:19:42,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 08:19:42,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 08:19:42,418 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 08:19:42,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,429 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (1/1) ... [2018-01-21 08:19:42,453 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 08:19:42,453 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 08:19:42,454 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 08:19:42,454 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 08:19:42,455 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (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:19:42,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 08:19:42,504 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 08:19:42,504 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-21 08:19:42,504 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 08:19:42,504 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 08:19:42,505 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 08:19:42,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 08:19:42,505 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 08:19:42,505 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 08:19:42,505 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 08:19:42,505 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 08:19:42,506 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 08:19:42,506 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-21 08:19:42,506 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 08:19:42,506 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 08:19:42,506 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 08:19:42,789 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 08:19:42,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:19:42 BoogieIcfgContainer [2018-01-21 08:19:42,789 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 08:19:42,790 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 08:19:42,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 08:19:42,793 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 08:19:42,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 08:19:42" (1/3) ... [2018-01-21 08:19:42,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cb9f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:19:42, skipping insertion in model container [2018-01-21 08:19:42,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 08:19:42" (2/3) ... [2018-01-21 08:19:42,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56cb9f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 08:19:42, skipping insertion in model container [2018-01-21 08:19:42,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 08:19:42" (3/3) ... [2018-01-21 08:19:42,798 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_false-valid-free.i [2018-01-21 08:19:42,805 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 08:19:42,814 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-21 08:19:42,867 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:19:42,868 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:19:42,868 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:19:42,868 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:19:42,868 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:19:42,868 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:19:42,868 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:19:42,868 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 08:19:42,869 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:19:42,884 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 08:19:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 08:19:42,890 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:42,891 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 08:19:42,892 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 08:19:42,896 INFO L82 PathProgramCache]: Analyzing trace with hash 125893, now seen corresponding path program 1 times [2018-01-21 08:19:42,898 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:42,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:42,942 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:42,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:42,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:42,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:19:42,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:19:43,001 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:19:43,009 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:19:43,015 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:19:43,015 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:19:43,016 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:19:43,016 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:19:43,016 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:19:43,016 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:19:43,016 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:19:43,016 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 08:19:43,016 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:19:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 08:19:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 08:19:43,020 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:43,020 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:19:43,020 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:19:43,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1201666841, now seen corresponding path program 1 times [2018-01-21 08:19:43,021 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:43,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:43,022 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:43,022 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:43,022 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:43,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:19:43,043 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:19:43,079 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:19:43,080 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:19:43,080 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:19:43,080 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:19:43,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:19:43,099 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:19:43,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:19:43,103 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-21 08:19:43,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:19:43,204 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-21 08:19:43,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:19:43,206 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-01-21 08:19:43,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:19:43,216 INFO L225 Difference]: With dead ends: 105 [2018-01-21 08:19:43,217 INFO L226 Difference]: Without dead ends: 64 [2018-01-21 08:19:43,219 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:19:43,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-21 08:19:43,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-21 08:19:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 08:19:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-01-21 08:19:43,254 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 17 [2018-01-21 08:19:43,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:19:43,254 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-01-21 08:19:43,254 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:19:43,254 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-01-21 08:19:43,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-21 08:19:43,256 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:43,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] [2018-01-21 08:19:43,256 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:19:43,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1521991172, now seen corresponding path program 1 times [2018-01-21 08:19:43,256 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:43,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:43,257 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:43,257 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:43,258 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:19:43,298 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:19:43,495 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:19:43,495 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:19:43,496 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 08:19:43,496 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:19:43,498 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 08:19:43,498 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 08:19:43,498 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 08:19:43,499 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 8 states. [2018-01-21 08:19:43,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:19:43,779 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2018-01-21 08:19:43,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 08:19:43,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-01-21 08:19:43,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:19:43,784 INFO L225 Difference]: With dead ends: 93 [2018-01-21 08:19:43,784 INFO L226 Difference]: Without dead ends: 71 [2018-01-21 08:19:43,785 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 08:19:43,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-21 08:19:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-01-21 08:19:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-21 08:19:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2018-01-21 08:19:43,798 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 37 [2018-01-21 08:19:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:19:43,799 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2018-01-21 08:19:43,799 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 08:19:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2018-01-21 08:19:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-01-21 08:19:43,801 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:43,801 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:19:43,801 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 08:19:43,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1267549394, now seen corresponding path program 1 times [2018-01-21 08:19:43,802 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:43,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:43,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:43,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:43,803 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:43,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:19:43,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:19:43,961 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:19:43,961 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:19:43,961 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 08:19:43,961 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:19:43,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 08:19:43,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 08:19:43,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:19:43,963 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand 6 states. [2018-01-21 08:19:44,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:19:44,004 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2018-01-21 08:19:44,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:19:44,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2018-01-21 08:19:44,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:19:44,005 INFO L225 Difference]: With dead ends: 83 [2018-01-21 08:19:44,005 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:19:44,006 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:19:44,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:19:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:19:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:19:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:19:44,007 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2018-01-21 08:19:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:19:44,007 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:19:44,007 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 08:19:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:19:44,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:19:44,010 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:19:44,010 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:19:44,010 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:19:44,010 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:19:44,010 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:19:44,010 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:19:44,010 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:19:44,011 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 08:19:44,011 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:19:44,012 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 08:19:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 08:19:44,013 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:44,013 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:19:44,013 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 08:19:44,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1051528599, now seen corresponding path program 1 times [2018-01-21 08:19:44,013 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:44,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,014 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:44,014 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,014 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:44,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:19:44,020 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:19:44,027 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:19:44,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:19:44,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 08:19:44,028 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:19:44,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 08:19:44,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 08:19:44,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 08:19:44,029 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 2 states. [2018-01-21 08:19:44,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:19:44,035 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2018-01-21 08:19:44,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 08:19:44,035 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-01-21 08:19:44,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:19:44,037 INFO L225 Difference]: With dead ends: 105 [2018-01-21 08:19:44,037 INFO L226 Difference]: Without dead ends: 62 [2018-01-21 08:19:44,037 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:19:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-01-21 08:19:44,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2018-01-21 08:19:44,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 08:19:44,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2018-01-21 08:19:44,044 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 15 [2018-01-21 08:19:44,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:19:44,045 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2018-01-21 08:19:44,045 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 08:19:44,045 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2018-01-21 08:19:44,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-21 08:19:44,046 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:44,046 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:19:44,047 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-21 08:19:44,047 INFO L82 PathProgramCache]: Analyzing trace with hash 2106609350, now seen corresponding path program 1 times [2018-01-21 08:19:44,047 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:44,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,048 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:44,048 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,049 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:19:44,065 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:19:44,197 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:19:44,198 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:19:44,198 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-21 08:19:44,198 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:19:44,198 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-21 08:19:44,199 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-21 08:19:44,199 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-21 08:19:44,199 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 8 states. [2018-01-21 08:19:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:19:44,372 INFO L93 Difference]: Finished difference Result 89 states and 95 transitions. [2018-01-21 08:19:44,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-21 08:19:44,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-21 08:19:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:19:44,373 INFO L225 Difference]: With dead ends: 89 [2018-01-21 08:19:44,374 INFO L226 Difference]: Without dead ends: 69 [2018-01-21 08:19:44,374 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 08:19:44,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-21 08:19:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-01-21 08:19:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-21 08:19:44,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 65 transitions. [2018-01-21 08:19:44,380 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 65 transitions. Word has length 35 [2018-01-21 08:19:44,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:19:44,380 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 65 transitions. [2018-01-21 08:19:44,380 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-21 08:19:44,380 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 65 transitions. [2018-01-21 08:19:44,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-01-21 08:19:44,381 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:44,382 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 08:19:44,382 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-21 08:19:44,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1721987472, now seen corresponding path program 1 times [2018-01-21 08:19:44,382 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:44,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,383 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:44,383 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,383 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 08:19:44,405 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 08:19:44,509 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:19:44,509 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 08:19:44,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 08:19:44,510 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 08:19:44,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 08:19:44,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 08:19:44,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-01-21 08:19:44,511 INFO L87 Difference]: Start difference. First operand 62 states and 65 transitions. Second operand 6 states. [2018-01-21 08:19:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 08:19:44,574 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-01-21 08:19:44,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 08:19:44,576 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-01-21 08:19:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 08:19:44,576 INFO L225 Difference]: With dead ends: 81 [2018-01-21 08:19:44,576 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 08:19:44,577 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:19:44,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 08:19:44,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 08:19:44,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 08:19:44,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 08:19:44,579 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2018-01-21 08:19:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 08:19:44,579 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 08:19:44,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 08:19:44,579 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 08:19:44,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 08:19:44,581 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 08:19:44,582 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 08:19:44,582 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 08:19:44,582 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 08:19:44,582 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 08:19:44,582 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 08:19:44,582 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 08:19:44,582 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == appendErr0EnsuresViolation======== [2018-01-21 08:19:44,582 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 08:19:44,584 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-01-21 08:19:44,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 08:19:44,585 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 08:19:44,586 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 08:19:44,586 INFO L371 AbstractCegarLoop]: === Iteration 1 === [appendErr0EnsuresViolation]=== [2018-01-21 08:19:44,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1137567503, now seen corresponding path program 1 times [2018-01-21 08:19:44,586 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 08:19:44,587 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,588 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 08:19:44,588 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 08:19:44,588 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 08:19:44,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:19:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 08:19:44,615 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 08:19:44,621 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:19:44,625 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 08:19:44,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 08:19:44 BoogieIcfgContainer [2018-01-21 08:19:44,639 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 08:19:44,641 INFO L168 Benchmark]: Toolchain (without parser) took 2437.85 ms. Allocated memory was 305.1 MB in the beginning and 488.1 MB in the end (delta: 183.0 MB). Free memory was 262.3 MB in the beginning and 432.1 MB in the end (delta: -169.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-21 08:19:44,642 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 305.1 MB. Free memory is still 268.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:19:44,643 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.53 ms. Allocated memory is still 305.1 MB. Free memory was 262.3 MB in the beginning and 252.3 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:19:44,643 INFO L168 Benchmark]: Boogie Preprocessor took 35.03 ms. Allocated memory is still 305.1 MB. Free memory was 252.3 MB in the beginning and 250.3 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:19:44,643 INFO L168 Benchmark]: RCFGBuilder took 336.10 ms. Allocated memory is still 305.1 MB. Free memory was 250.3 MB in the beginning and 227.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. [2018-01-21 08:19:44,644 INFO L168 Benchmark]: TraceAbstraction took 1849.10 ms. Allocated memory was 305.1 MB in the beginning and 488.1 MB in the end (delta: 183.0 MB). Free memory was 227.3 MB in the beginning and 432.1 MB in the end (delta: -204.9 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 08:19:44,645 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.12 ms. Allocated memory is still 305.1 MB. Free memory is still 268.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.53 ms. Allocated memory is still 305.1 MB. Free memory was 262.3 MB in the beginning and 252.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.03 ms. Allocated memory is still 305.1 MB. Free memory was 252.3 MB in the beginning and 250.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 336.10 ms. Allocated memory is still 305.1 MB. Free memory was 250.3 MB in the beginning and 227.3 MB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1849.10 ms. Allocated memory was 305.1 MB in the beginning and 488.1 MB in the end (delta: 183.0 MB). Free memory was 227.3 MB in the beginning and 432.1 MB in the end (delta: -204.9 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. UNSAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. SAFE Result, 0.9s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 147 SDtfs, 72 SDslu, 188 SDs, 0 SdLazy, 140 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 17859 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 633]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. SAFE Result, 0.5s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 145 SDtfs, 72 SDslu, 180 SDs, 0 SdLazy, 140 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 16803 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 624]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L635] FCALL struct item *list = ((void *)0); VAL [list={11:0}] [L637] CALL append(&list) VAL [plist={11:0}] [L626] EXPR, FCALL malloc(sizeof *item) VAL [malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L626] struct item *item = malloc(sizeof *item); VAL [item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] EXPR, FCALL \read(**plist) VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L627] FCALL item->next = *plist VAL [\read(**plist)={0:0}, item={9:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628] EXPR, FCALL item->next VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L628-L630] COND FALSE, EXPR !((item->next) ? item->next->data : malloc(sizeof *item)) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, plist={11:0}, plist={11:0}] [L630] EXPR, FCALL malloc(sizeof *item) VAL [item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L628-L630] EXPR (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L628-L630] FCALL item->data = (item->next) ? item->next->data : malloc(sizeof *item) VAL [(item->next) ? item->next->data : malloc(sizeof *item)={13:0}, item={9:0}, item->next={0:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] [L631] FCALL *plist = item VAL [item={9:0}, malloc(sizeof *item)={9:0}, malloc(sizeof *item)={13:0}, plist={11:0}, plist={11:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: appendErr0EnsuresViolation CFG has 4 procedures, 68 locations, 4 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_08-19-44-655.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_08-19-44-655.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_08-19-44-655.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_08-19-44-655.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0232_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_08-19-44-655.csv Received shutdown request...