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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:27:51,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:27:51,876 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:27:51,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:27:51,891 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:27:51,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:27:51,893 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:27:51,894 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:27:51,897 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:27:51,897 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:27:51,898 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:27:51,898 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:27:51,898 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:27:51,900 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:27:51,901 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:27:51,903 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:27:51,905 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:27:51,907 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:27:51,908 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:27:51,910 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:27:51,912 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:27:51,912 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:27:51,912 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:27:51,913 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:27:51,914 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:27:51,915 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:27:51,915 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:27:51,916 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:27:51,916 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:27:51,916 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:27:51,917 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:27:51,918 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_mostprecise.epf [2018-01-21 03:27:51,927 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:27:51,928 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:27:51,929 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:27:51,929 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:27:51,929 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:27:51,929 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:27:51,930 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:27:51,930 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:27:51,930 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:27:51,931 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:27:51,931 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:27:51,931 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:27:51,931 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:27:51,931 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:27:51,932 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:27:51,932 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:27:51,932 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:27:51,932 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:27:51,932 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:27:51,932 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:27:51,933 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:27:51,933 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:27:51,933 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:27:51,933 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:27:51,934 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:27:51,934 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:27:51,934 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:27:51,934 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:27:51,934 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:27:51,935 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:27:51,935 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:27:51,935 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:27:51,935 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:27:51,935 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:27:51,935 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:27:51,936 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:27:51,936 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:27:51,936 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:27:51,937 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:27:51,937 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:27:51,973 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:27:51,985 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:27:51,989 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:27:51,991 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:27:51,992 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:27:51,992 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_2_false-valid-free.i [2018-01-21 03:27:52,191 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:27:52,196 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:27:52,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:27:52,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:27:52,203 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:27:52,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,208 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21a8c6a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52, skipping insertion in model container [2018-01-21 03:27:52,208 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,231 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:27:52,284 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:27:52,397 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:27:52,410 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:27:52,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52 WrapperNode [2018-01-21 03:27:52,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:27:52,417 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:27:52,417 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:27:52,417 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:27:52,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,455 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,457 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (1/1) ... [2018-01-21 03:27:52,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:27:52,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:27:52,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:27:52,459 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:27:52,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (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 03:27:52,515 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:27:52,516 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:27:52,516 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 03:27:52,516 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_8 [2018-01-21 03:27:52,516 INFO L136 BoogieDeclarations]: Found implementation of procedure free_8 [2018-01-21 03:27:52,516 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 03:27:52,516 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:27:52,516 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:27:52,517 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:27:52,517 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:27:52,517 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:27:52,517 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:27:52,517 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:27:52,517 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 03:27:52,517 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_8 [2018-01-21 03:27:52,518 INFO L128 BoogieDeclarations]: Found specification of procedure free_8 [2018-01-21 03:27:52,518 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 03:27:52,518 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:27:52,518 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:27:52,518 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:27:52,694 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:27:52,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:27:52 BoogieIcfgContainer [2018-01-21 03:27:52,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:27:52,695 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:27:52,695 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:27:52,697 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:27:52,697 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:27:52" (1/3) ... [2018-01-21 03:27:52,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea02faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:27:52, skipping insertion in model container [2018-01-21 03:27:52,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:27:52" (2/3) ... [2018-01-21 03:27:52,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ea02faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:27:52, skipping insertion in model container [2018-01-21 03:27:52,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:27:52" (3/3) ... [2018-01-21 03:27:52,700 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test8_2_false-valid-free.i [2018-01-21 03:27:52,707 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:27:52,714 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 03:27:52,755 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:27:52,755 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:27:52,755 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:27:52,755 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:27:52,755 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:27:52,756 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:27:52,756 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:27:52,756 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_8Err0EnsuresViolation======== [2018-01-21 03:27:52,757 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:27:52,779 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 03:27:52,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 03:27:52,786 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:52,787 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:27:52,788 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_8Err0EnsuresViolation]=== [2018-01-21 03:27:52,793 INFO L82 PathProgramCache]: Analyzing trace with hash -103175248, now seen corresponding path program 1 times [2018-01-21 03:27:52,796 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:52,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:52,865 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:52,865 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:52,865 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:27:52,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:27:53,006 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 03:27:53,008 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:27:53,008 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:27:53,008 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:27:53,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:27:53,021 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:27:53,022 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:53,024 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 03:27:53,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:27:53,161 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 03:27:53,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:27:53,233 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-01-21 03:27:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:27:53,243 INFO L225 Difference]: With dead ends: 41 [2018-01-21 03:27:53,243 INFO L226 Difference]: Without dead ends: 26 [2018-01-21 03:27:53,247 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:53,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-21 03:27:53,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-01-21 03:27:53,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-21 03:27:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-21 03:27:53,283 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-01-21 03:27:53,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:27:53,284 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-21 03:27:53,284 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:27:53,284 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-21 03:27:53,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 03:27:53,285 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:53,285 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:27:53,286 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_8Err0EnsuresViolation]=== [2018-01-21 03:27:53,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1096531578, now seen corresponding path program 1 times [2018-01-21 03:27:53,286 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:53,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,288 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:53,288 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,288 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:53,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:27:53,311 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:27:53,418 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 03:27:53,418 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:27:53,419 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:27:53,419 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:27:53,421 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:27:53,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:27:53,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:27:53,422 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-01-21 03:27:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:27:53,543 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-01-21 03:27:53,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:27:53,544 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 03:27:53,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:27:53,545 INFO L225 Difference]: With dead ends: 41 [2018-01-21 03:27:53,545 INFO L226 Difference]: Without dead ends: 24 [2018-01-21 03:27:53,546 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-21 03:27:53,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-21 03:27:53,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-21 03:27:53,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-21 03:27:53,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-01-21 03:27:53,553 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2018-01-21 03:27:53,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:27:53,554 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-01-21 03:27:53,554 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:27:53,554 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-01-21 03:27:53,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 03:27:53,555 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:53,555 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] [2018-01-21 03:27:53,555 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_8Err0EnsuresViolation]=== [2018-01-21 03:27:53,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1488467900, now seen corresponding path program 1 times [2018-01-21 03:27:53,556 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:53,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:53,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,558 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:53,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:27:53,580 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:27:53,622 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 03:27:53,622 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:27:53,622 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:27:53,623 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:27:53,623 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:27:53,623 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:27:53,623 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:27:53,623 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 4 states. [2018-01-21 03:27:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:27:53,644 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-01-21 03:27:53,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:27:53,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-21 03:27:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:27:53,644 INFO L225 Difference]: With dead ends: 24 [2018-01-21 03:27:53,645 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:27:53,645 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 03:27:53,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:27:53,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:27:53,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:27:53,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:27:53,646 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-01-21 03:27:53,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:27:53,646 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:27:53,646 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:27:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:27:53,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:27:53,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 03:27:53,810 INFO L401 ceAbstractionStarter]: For program point L1441''(line 1441) no Hoare annotation was computed. [2018-01-21 03:27:53,810 INFO L401 ceAbstractionStarter]: For program point free_8Err0EnsuresViolation(lines 1440 1442) no Hoare annotation was computed. [2018-01-21 03:27:53,810 INFO L397 ceAbstractionStarter]: At program point free_8ENTRY(lines 1440 1442) the Hoare annotation is: (or (not (= 0 ~a8.offset)) (not (= 0 ~a8.base)) (= |#valid| |old(#valid)|)) [2018-01-21 03:27:53,810 INFO L401 ceAbstractionStarter]: For program point free_8EXIT(lines 1440 1442) no Hoare annotation was computed. [2018-01-21 03:27:53,810 INFO L401 ceAbstractionStarter]: For program point L1441(line 1441) no Hoare annotation was computed. [2018-01-21 03:27:53,810 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= 0 ~a8.offset)) (not (= 0 ~a8.base)) (= |#valid| |old(#valid)|)) [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,811 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,812 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1454) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 03:27:53,812 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,812 INFO L401 ceAbstractionStarter]: For program point alloc_8Err0EnsuresViolation(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 03:27:53,812 INFO L397 ceAbstractionStarter]: At program point alloc_8ENTRY(lines 1436 1438) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 03:27:53,812 INFO L401 ceAbstractionStarter]: For program point alloc_8EXIT(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 03:27:53,812 INFO L401 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-21 03:27:53,812 INFO L401 ceAbstractionStarter]: For program point alloc_8FINAL(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 03:27:53,812 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1454) the Hoare annotation is: true [2018-01-21 03:27:53,812 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,813 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1454) the Hoare annotation is: (and (= ~a8.offset 0) (= 0 ~a8.base)) [2018-01-21 03:27:53,813 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,813 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,813 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1452 1454) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 03:27:53,813 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1452 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,813 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1452 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,813 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1452 1454) no Hoare annotation was computed. [2018-01-21 03:27:53,813 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1444 1450) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 03:27:53,813 INFO L397 ceAbstractionStarter]: At program point L1447(line 1447) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 03:27:53,813 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1444 1450) no Hoare annotation was computed. [2018-01-21 03:27:53,814 INFO L401 ceAbstractionStarter]: For program point L1448(line 1448) no Hoare annotation was computed. [2018-01-21 03:27:53,814 INFO L397 ceAbstractionStarter]: At program point L1446(line 1446) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-21 03:27:53,814 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1444 1450) no Hoare annotation was computed. [2018-01-21 03:27:53,814 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1444 1450) no Hoare annotation was computed. [2018-01-21 03:27:53,817 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:27:53,817 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:27:53,818 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:27:53,818 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:27:53,818 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:27:53,818 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:27:53,818 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:27:53,818 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 03:27:53,818 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:27:53,820 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 03:27:53,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 03:27:53,820 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:53,821 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:27:53,821 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:27:53,821 INFO L82 PathProgramCache]: Analyzing trace with hash 815176381, now seen corresponding path program 1 times [2018-01-21 03:27:53,821 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:53,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,822 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:53,822 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,822 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:53,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:27:53,841 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:27:53,874 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 03:27:53,874 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:27:53,874 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:27:53,874 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:27:53,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:27:53,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:27:53,875 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:53,875 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 03:27:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:27:53,966 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 03:27:53,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:27:53,967 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 03:27:53,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:27:53,968 INFO L225 Difference]: With dead ends: 41 [2018-01-21 03:27:53,968 INFO L226 Difference]: Without dead ends: 14 [2018-01-21 03:27:53,969 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:53,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-01-21 03:27:53,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-01-21 03:27:53,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-01-21 03:27:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-01-21 03:27:53,972 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 11 [2018-01-21 03:27:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:27:53,973 INFO L432 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-01-21 03:27:53,973 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:27:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-01-21 03:27:53,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 03:27:53,974 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:53,974 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:27:53,974 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:27:53,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1700361727, now seen corresponding path program 1 times [2018-01-21 03:27:53,974 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:53,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,976 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:53,976 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:53,976 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:53,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:27:54,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:27:54,031 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:27:54,040 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,042 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,055 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:27:54,055 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:27:54,055 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:27:54,055 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:27:54,055 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:27:54,055 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:27:54,055 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:27:54,055 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:27:54,055 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:27:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 03:27:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:27:54,057 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:54,057 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:27:54,057 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:27:54,057 INFO L82 PathProgramCache]: Analyzing trace with hash 70955, now seen corresponding path program 1 times [2018-01-21 03:27:54,057 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:54,058 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,058 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:54,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,059 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:27:54,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:27:54,067 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:27:54,069 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,071 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:27:54,071 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:27:54,072 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:27:54,072 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:27:54,072 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:27:54,072 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:27:54,072 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:27:54,072 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_8Err0EnsuresViolation======== [2018-01-21 03:27:54,072 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:27:54,074 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 03:27:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 03:27:54,075 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:54,075 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:27:54,075 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_8Err0EnsuresViolation]=== [2018-01-21 03:27:54,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1174482797, now seen corresponding path program 1 times [2018-01-21 03:27:54,075 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:54,076 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,077 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:54,077 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,077 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:27:54,085 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:27:54,110 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 03:27:54,110 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:27:54,111 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:27:54,111 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:27:54,111 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:27:54,111 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:27:54,112 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:54,112 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 03:27:54,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:27:54,181 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 03:27:54,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:27:54,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-21 03:27:54,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:27:54,181 INFO L225 Difference]: With dead ends: 41 [2018-01-21 03:27:54,182 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:27:54,182 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:54,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:27:54,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:27:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:27:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:27:54,183 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 03:27:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:27:54,184 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:27:54,184 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:27:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:27:54,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:27:54,186 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:27:54,186 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:27:54,186 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:27:54,186 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:27:54,186 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:27:54,187 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:27:54,187 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:27:54,187 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:27:54,187 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:27:54,188 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 03:27:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 03:27:54,189 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:54,189 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 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 03:27:54,189 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:27:54,189 INFO L82 PathProgramCache]: Analyzing trace with hash 984599609, now seen corresponding path program 1 times [2018-01-21 03:27:54,189 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:54,190 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,191 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:54,191 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,191 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:27:54,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:27:54,218 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:27:54,223 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,225 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,226 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,227 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,228 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,229 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,229 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,230 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:27:54,236 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:27:54,236 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:27:54,236 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:27:54,237 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:27:54,237 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:27:54,237 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:27:54,237 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:27:54,237 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:27:54,237 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:27:54,238 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 03:27:54,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 03:27:54,240 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:54,240 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 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 03:27:54,240 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:27:54,240 INFO L82 PathProgramCache]: Analyzing trace with hash -647019416, now seen corresponding path program 1 times [2018-01-21 03:27:54,241 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:54,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,242 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:54,242 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,242 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:27:54,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:27:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 03:27:54,297 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:27:54,297 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:27:54,297 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:27:54,297 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:27:54,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:27:54,297 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:54,298 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 03:27:54,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:27:54,409 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 03:27:54,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:27:54,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-21 03:27:54,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:27:54,411 INFO L225 Difference]: With dead ends: 41 [2018-01-21 03:27:54,411 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:27:54,411 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:54,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:27:54,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:27:54,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:27:54,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:27:54,412 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 03:27:54,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:27:54,413 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:27:54,413 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:27:54,413 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:27:54,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:27:54,415 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:27:54,415 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:27:54,416 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:27:54,416 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:27:54,416 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:27:54,416 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:27:54,416 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:27:54,416 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 03:27:54,416 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:27:54,418 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 03:27:54,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 03:27:54,419 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:27:54,419 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:27:54,419 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:27:54,419 INFO L82 PathProgramCache]: Analyzing trace with hash -778326045, now seen corresponding path program 1 times [2018-01-21 03:27:54,420 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:27:54,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,421 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:27:54,421 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:27:54,421 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:27:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:27:54,431 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:27:54,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-21 03:27:54,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:27:54,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:27:54,508 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:27:54,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:27:54,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:27:54,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:54,509 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 03:27:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:27:54,594 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 03:27:54,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:27:54,594 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 03:27:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:27:54,595 INFO L225 Difference]: With dead ends: 41 [2018-01-21 03:27:54,595 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:27:54,596 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:27:54,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:27:54,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:27:54,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:27:54,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:27:54,597 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 03:27:54,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:27:54,597 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:27:54,597 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:27:54,597 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:27:54,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:27:54,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:27:54 BoogieIcfgContainer [2018-01-21 03:27:54,600 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:27:54,601 INFO L168 Benchmark]: Toolchain (without parser) took 2408.74 ms. Allocated memory was 306.7 MB in the beginning and 467.1 MB in the end (delta: 160.4 MB). Free memory was 264.0 MB in the beginning and 323.9 MB in the end (delta: -59.9 MB). Peak memory consumption was 100.6 MB. Max. memory is 5.3 GB. [2018-01-21 03:27:54,602 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:27:54,602 INFO L168 Benchmark]: CACSL2BoogieTranslator took 219.28 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 251.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-21 03:27:54,602 INFO L168 Benchmark]: Boogie Preprocessor took 41.88 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 249.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:27:54,603 INFO L168 Benchmark]: RCFGBuilder took 235.53 ms. Allocated memory is still 306.7 MB. Free memory was 249.9 MB in the beginning and 235.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-21 03:27:54,603 INFO L168 Benchmark]: TraceAbstraction took 1904.37 ms. Allocated memory was 306.7 MB in the beginning and 467.1 MB in the end (delta: 160.4 MB). Free memory was 235.3 MB in the beginning and 323.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 71.8 MB. Max. memory is 5.3 GB. [2018-01-21 03:27:54,605 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.24 ms. Allocated memory is still 306.7 MB. Free memory is still 271.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 219.28 ms. Allocated memory is still 306.7 MB. Free memory was 264.0 MB in the beginning and 251.9 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 41.88 ms. Allocated memory is still 306.7 MB. Free memory was 251.9 MB in the beginning and 249.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 235.53 ms. Allocated memory is still 306.7 MB. Free memory was 249.9 MB in the beginning and 235.3 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1904.37 ms. Allocated memory was 306.7 MB in the beginning and 467.1 MB in the end (delta: 160.4 MB). Free memory was 235.3 MB in the beginning and 323.9 MB in the end (delta: -88.6 MB). Peak memory consumption was 71.8 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) - 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) - 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) - 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: - PositiveResult [Line: 1440]: 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: free_8Err0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. SAFE Result, 1.0s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 30 SDslu, 62 SDs, 0 SdLazy, 45 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 14 PreInvPairs, 16 NumberOfFragments, 130 HoareAnnotationTreeSize, 14 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 58 NumberOfCodeBlocks, 58 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 2077 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: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1434] int *a8; VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1453] CALL entry_point() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1446] CALL alloc_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1437] CALL ldv_malloc(sizeof(int)) VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, a8={0:0}] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, a8={0:0}, malloc(size)={7:0}, size=4] [L1074] return malloc(size); VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, \result={7:0}, a8={0:0}, malloc(size)={7:0}, size=4] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. UNSAFE Result, 0.2s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 10 SDslu, 1 SDs, 0 SdLazy, 22 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 160 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1434] int *a8; VAL [\old(a8)=1, \old(a8)=3, a8={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 37 locations, 7 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=37occurred 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: 1436]: 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: alloc_8Err0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 8 SDslu, 1 SDs, 0 SdLazy, 22 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 351 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1434] int *a8; VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1453] CALL entry_point() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1446] CALL alloc_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1437] CALL, EXPR ldv_malloc(sizeof(int)) VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, a8={0:0}] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(a8)=0, \old(a8)=0, \old(size)=4, \result={0:0}, a8={0:0}, size=4] [L1437] EXPR ldv_malloc(sizeof(int)) VAL [\old(a8)=0, \old(a8)=0, a8={0:0}, ldv_malloc(sizeof(int))={0:0}] [L1437] RET a8 = (int *)ldv_malloc(sizeof(int)) [L1446] alloc_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1447] CALL free_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1441] COND FALSE, RET !(\read(*a8)) VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1447] free_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1448] CALL free_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1441] COND FALSE, RET !(\read(*a8)) VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1448] free_8() VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1449] RET a8 = 0 VAL [\old(a8)=0, \old(a8)=0, a8={0:0}] [L1453] entry_point() VAL [a8={0:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. UNSAFE Result, 0.0s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 29 NumberOfCodeBlocks, 29 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: 1452]: 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 7 procedures, 37 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 3 SDslu, 1 SDs, 0 SdLazy, 22 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1820 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1444]: 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: entry_pointErr0EnsuresViolation CFG has 7 procedures, 37 locations, 7 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 2 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 23 SDtfs, 4 SDslu, 1 SDs, 0 SdLazy, 22 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 1488 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 3/3 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/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-27-54-617.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-27-54-617.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-27-54-617.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-27-54-617.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-27-54-617.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_03-27-54-617.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_03-27-54-617.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_03-27-54-617.csv Received shutdown request...