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_smtcomp.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 10:39:50,413 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 10:39:50,416 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 10:39:50,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 10:39:50,429 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 10:39:50,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 10:39:50,430 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 10:39:50,431 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 10:39:50,433 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 10:39:50,434 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 10:39:50,435 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 10:39:50,435 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 10:39:50,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 10:39:50,436 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 10:39:50,437 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 10:39:50,440 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 10:39:50,442 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 10:39:50,445 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 10:39:50,446 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 10:39:50,448 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 10:39:50,450 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 10:39:50,450 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 10:39:50,451 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 10:39:50,452 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 10:39:50,453 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 10:39:50,454 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 10:39:50,454 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 10:39:50,455 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 10:39:50,455 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 10:39:50,455 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 10:39:50,456 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 10:39:50,456 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_smtcomp.epf [2018-01-21 10:39:50,466 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 10:39:50,467 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 10:39:50,467 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 10:39:50,468 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 10:39:50,468 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 10:39:50,468 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 10:39:50,468 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 10:39:50,469 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 10:39:50,469 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 10:39:50,470 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 10:39:50,470 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 10:39:50,470 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 10:39:50,470 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 10:39:50,470 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 10:39:50,470 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 10:39:50,471 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 10:39:50,471 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 10:39:50,471 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 10:39:50,471 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 10:39:50,471 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 10:39:50,472 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 10:39:50,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 10:39:50,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 10:39:50,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 10:39:50,473 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 10:39:50,473 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 10:39:50,473 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 10:39:50,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 10:39:50,473 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 10:39:50,474 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 10:39:50,474 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 10:39:50,474 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 10:39:50,474 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 10:39:50,474 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 10:39:50,475 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 10:39:50,475 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 10:39:50,475 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 10:39:50,476 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 10:39:50,476 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 10:39:50,512 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 10:39:50,527 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 10:39:50,531 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 10:39:50,533 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 10:39:50,534 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 10:39:50,534 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 10:39:50,723 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 10:39:50,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 10:39:50,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 10:39:50,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 10:39:50,733 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 10:39:50,734 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c4b3da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50, skipping insertion in model container [2018-01-21 10:39:50,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,753 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:39:50,803 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 10:39:50,909 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:39:50,921 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 10:39:50,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50 WrapperNode [2018-01-21 10:39:50,929 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 10:39:50,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 10:39:50,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 10:39:50,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 10:39:50,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,958 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,959 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,965 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,966 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (1/1) ... [2018-01-21 10:39:50,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 10:39:50,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 10:39:50,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 10:39:50,969 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 10:39:50,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (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 10:39:51,031 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 10:39:51,032 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 10:39:51,032 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 10:39:51,032 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_8 [2018-01-21 10:39:51,032 INFO L136 BoogieDeclarations]: Found implementation of procedure free_8 [2018-01-21 10:39:51,032 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 10:39:51,032 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 10:39:51,032 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 10:39:51,033 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 10:39:51,033 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 10:39:51,033 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 10:39:51,033 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 10:39:51,033 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 10:39:51,033 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 10:39:51,034 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_8 [2018-01-21 10:39:51,034 INFO L128 BoogieDeclarations]: Found specification of procedure free_8 [2018-01-21 10:39:51,034 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 10:39:51,034 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 10:39:51,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 10:39:51,034 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 10:39:51,203 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 10:39:51,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:39:51 BoogieIcfgContainer [2018-01-21 10:39:51,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 10:39:51,205 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 10:39:51,205 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 10:39:51,206 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 10:39:51,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 10:39:50" (1/3) ... [2018-01-21 10:39:51,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c75293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:39:51, skipping insertion in model container [2018-01-21 10:39:51,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 10:39:50" (2/3) ... [2018-01-21 10:39:51,208 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c75293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 10:39:51, skipping insertion in model container [2018-01-21 10:39:51,208 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 10:39:51" (3/3) ... [2018-01-21 10:39:51,210 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test8_2_false-valid-free.i [2018-01-21 10:39:51,217 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 10:39:51,224 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 10:39:51,260 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:39:51,260 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:39:51,260 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:39:51,260 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:39:51,260 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:39:51,261 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:39:51,261 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:39:51,261 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_8Err0EnsuresViolation======== [2018-01-21 10:39:51,262 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:39:51,283 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 10:39:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 10:39:51,290 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:51,292 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 10:39:51,292 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_8Err0EnsuresViolation]=== [2018-01-21 10:39:51,298 INFO L82 PathProgramCache]: Analyzing trace with hash -103175248, now seen corresponding path program 1 times [2018-01-21 10:39:51,301 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:51,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:51,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:51,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:51,355 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:51,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:39:51,412 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:39:51,481 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 10:39:51,482 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:39:51,483 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:39:51,483 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:39:51,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:39:51,496 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:39:51,496 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:39:51,499 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 10:39:51,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:39:51,641 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 10:39:51,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:39:51,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-01-21 10:39:51,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:39:51,718 INFO L225 Difference]: With dead ends: 41 [2018-01-21 10:39:51,718 INFO L226 Difference]: Without dead ends: 26 [2018-01-21 10:39:51,723 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 10:39:51,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-01-21 10:39:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-01-21 10:39:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-01-21 10:39:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-01-21 10:39:51,767 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 18 [2018-01-21 10:39:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:39:51,768 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-01-21 10:39:51,768 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:39:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-01-21 10:39:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 10:39:51,769 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:51,770 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 10:39:51,770 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_8Err0EnsuresViolation]=== [2018-01-21 10:39:51,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1096531578, now seen corresponding path program 1 times [2018-01-21 10:39:51,770 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:51,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:51,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:51,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:51,772 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:39:51,793 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:39:51,918 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 10:39:51,918 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:39:51,919 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 10:39:51,919 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:39:51,921 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 10:39:51,921 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 10:39:51,921 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 10:39:51,922 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2018-01-21 10:39:51,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:39:51,987 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-01-21 10:39:51,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 10:39:51,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-01-21 10:39:51,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:39:51,989 INFO L225 Difference]: With dead ends: 41 [2018-01-21 10:39:51,989 INFO L226 Difference]: Without dead ends: 24 [2018-01-21 10:39:51,990 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 10:39:51,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-01-21 10:39:51,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-01-21 10:39:51,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-01-21 10:39:51,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-01-21 10:39:51,997 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 19 [2018-01-21 10:39:51,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:39:51,997 INFO L432 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-01-21 10:39:51,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 10:39:51,997 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-01-21 10:39:51,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-21 10:39:51,998 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:51,998 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 10:39:51,998 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_8Err0EnsuresViolation]=== [2018-01-21 10:39:51,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1488467900, now seen corresponding path program 1 times [2018-01-21 10:39:51,999 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,001 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:39:52,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:39:52,069 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 10:39:52,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:39:52,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 10:39:52,070 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:39:52,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 10:39:52,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 10:39:52,071 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 10:39:52,071 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 4 states. [2018-01-21 10:39:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:39:52,091 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-01-21 10:39:52,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 10:39:52,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-01-21 10:39:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:39:52,091 INFO L225 Difference]: With dead ends: 24 [2018-01-21 10:39:52,092 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:39:52,092 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 10:39:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:39:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:39:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:39:52,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:39:52,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-01-21 10:39:52,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:39:52,093 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:39:52,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 10:39:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:39:52,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:39:52,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 10:39:52,249 INFO L401 ceAbstractionStarter]: For program point L1441''(line 1441) no Hoare annotation was computed. [2018-01-21 10:39:52,249 INFO L401 ceAbstractionStarter]: For program point free_8Err0EnsuresViolation(lines 1440 1442) no Hoare annotation was computed. [2018-01-21 10:39:52,250 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 10:39:52,250 INFO L401 ceAbstractionStarter]: For program point free_8EXIT(lines 1440 1442) no Hoare annotation was computed. [2018-01-21 10:39:52,250 INFO L401 ceAbstractionStarter]: For program point L1441(line 1441) no Hoare annotation was computed. [2018-01-21 10:39:52,250 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 10:39:52,250 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 10:39:52,250 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 10:39:52,250 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:39:52,251 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:39:52,251 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 10:39:52,251 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 10:39:52,251 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,251 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,251 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1454) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 10:39:52,251 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,251 INFO L401 ceAbstractionStarter]: For program point alloc_8Err0EnsuresViolation(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 10:39:52,252 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 10:39:52,252 INFO L401 ceAbstractionStarter]: For program point alloc_8EXIT(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 10:39:52,252 INFO L401 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-21 10:39:52,252 INFO L401 ceAbstractionStarter]: For program point alloc_8FINAL(lines 1436 1438) no Hoare annotation was computed. [2018-01-21 10:39:52,252 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1454) the Hoare annotation is: true [2018-01-21 10:39:52,252 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,252 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1454) the Hoare annotation is: (and (= ~a8.offset 0) (= 0 ~a8.base)) [2018-01-21 10:39:52,252 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,252 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,253 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 10:39:52,253 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1452 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,253 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1452 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,253 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1452 1454) no Hoare annotation was computed. [2018-01-21 10:39:52,253 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 10:39:52,253 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 10:39:52,253 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1444 1450) no Hoare annotation was computed. [2018-01-21 10:39:52,253 INFO L401 ceAbstractionStarter]: For program point L1448(line 1448) no Hoare annotation was computed. [2018-01-21 10:39:52,254 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 10:39:52,254 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1444 1450) no Hoare annotation was computed. [2018-01-21 10:39:52,254 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1444 1450) no Hoare annotation was computed. [2018-01-21 10:39:52,256 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:39:52,256 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:39:52,257 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:39:52,257 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:39:52,257 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:39:52,257 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:39:52,257 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:39:52,257 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 10:39:52,257 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:39:52,258 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 10:39:52,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 10:39:52,259 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:52,259 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:39:52,259 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:39:52,260 INFO L82 PathProgramCache]: Analyzing trace with hash 815176381, now seen corresponding path program 1 times [2018-01-21 10:39:52,260 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,261 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,261 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,261 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:39:52,272 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:39:52,290 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 10:39:52,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:39:52,290 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:39:52,290 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:39:52,290 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:39:52,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:39:52,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:39:52,291 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 10:39:52,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:39:52,363 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 10:39:52,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:39:52,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 10:39:52,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:39:52,365 INFO L225 Difference]: With dead ends: 41 [2018-01-21 10:39:52,365 INFO L226 Difference]: Without dead ends: 14 [2018-01-21 10:39:52,365 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 10:39:52,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-01-21 10:39:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-01-21 10:39:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-01-21 10:39:52,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2018-01-21 10:39:52,369 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 11 [2018-01-21 10:39:52,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:39:52,369 INFO L432 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2018-01-21 10:39:52,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:39:52,369 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2018-01-21 10:39:52,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 10:39:52,370 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:52,370 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:39:52,370 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 10:39:52,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1700361727, now seen corresponding path program 1 times [2018-01-21 10:39:52,371 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,372 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,372 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,373 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:39:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:39:52,426 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:39:52,433 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,435 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,446 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:39:52,446 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:39:52,446 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:39:52,446 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:39:52,447 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:39:52,447 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:39:52,447 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:39:52,447 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 10:39:52,447 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:39:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 10:39:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 10:39:52,448 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:52,448 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 10:39:52,448 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 10:39:52,448 INFO L82 PathProgramCache]: Analyzing trace with hash 70955, now seen corresponding path program 1 times [2018-01-21 10:39:52,449 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,450 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:39:52,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:39:52,460 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:39:52,461 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,464 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:39:52,464 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:39:52,464 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:39:52,464 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:39:52,464 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:39:52,464 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:39:52,464 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:39:52,464 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_8Err0EnsuresViolation======== [2018-01-21 10:39:52,464 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:39:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 10:39:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 10:39:52,466 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:52,466 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 10:39:52,466 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_8Err0EnsuresViolation]=== [2018-01-21 10:39:52,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1174482797, now seen corresponding path program 1 times [2018-01-21 10:39:52,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,467 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,467 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,468 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,468 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:39:52,477 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:39:52,507 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 10:39:52,507 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:39:52,507 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:39:52,507 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:39:52,508 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:39:52,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:39:52,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:39:52,508 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 10:39:52,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:39:52,565 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 10:39:52,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:39:52,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-21 10:39:52,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:39:52,565 INFO L225 Difference]: With dead ends: 41 [2018-01-21 10:39:52,565 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:39:52,566 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 10:39:52,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:39:52,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:39:52,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:39:52,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:39:52,567 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 10:39:52,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:39:52,567 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:39:52,567 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:39:52,567 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:39:52,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:39:52,569 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:39:52,570 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:39:52,570 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:39:52,570 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:39:52,570 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:39:52,570 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:39:52,570 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:39:52,570 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 10:39:52,571 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:39:52,572 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 10:39:52,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 10:39:52,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:52,574 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 10:39:52,574 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 10:39:52,574 INFO L82 PathProgramCache]: Analyzing trace with hash 984599609, now seen corresponding path program 1 times [2018-01-21 10:39:52,574 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,577 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:39:52,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 10:39:52,605 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 10:39:52,610 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,612 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,612 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,613 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,614 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,615 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,616 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,616 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 10:39:52,622 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:39:52,623 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:39:52,623 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:39:52,623 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:39:52,623 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:39:52,623 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:39:52,623 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:39:52,624 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 10:39:52,624 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:39:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 10:39:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 10:39:52,626 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:52,626 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 10:39:52,627 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 10:39:52,627 INFO L82 PathProgramCache]: Analyzing trace with hash -647019416, now seen corresponding path program 1 times [2018-01-21 10:39:52,627 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,628 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,628 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,628 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:39:52,638 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:39:52,680 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 10:39:52,681 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:39:52,681 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:39:52,681 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:39:52,681 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:39:52,681 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:39:52,682 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:39:52,682 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 10:39:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:39:52,739 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 10:39:52,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:39:52,740 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-21 10:39:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:39:52,740 INFO L225 Difference]: With dead ends: 41 [2018-01-21 10:39:52,741 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:39:52,741 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 10:39:52,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:39:52,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:39:52,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:39:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:39:52,742 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 10:39:52,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:39:52,742 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:39:52,742 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:39:52,742 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:39:52,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:39:52,743 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 10:39:52,743 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 10:39:52,744 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 10:39:52,744 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 10:39:52,744 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 10:39:52,744 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 10:39:52,744 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 10:39:52,744 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 10:39:52,744 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 10:39:52,745 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-01-21 10:39:52,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 10:39:52,746 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 10:39:52,746 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 10:39:52,746 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 10:39:52,746 INFO L82 PathProgramCache]: Analyzing trace with hash -778326045, now seen corresponding path program 1 times [2018-01-21 10:39:52,746 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 10:39:52,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,747 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 10:39:52,747 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 10:39:52,747 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 10:39:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 10:39:52,756 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 10:39:52,787 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 10:39:52,787 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 10:39:52,787 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 10:39:52,787 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 10:39:52,788 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 10:39:52,788 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 10:39:52,788 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 10:39:52,788 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 3 states. [2018-01-21 10:39:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 10:39:52,842 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-21 10:39:52,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 10:39:52,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-01-21 10:39:52,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 10:39:52,843 INFO L225 Difference]: With dead ends: 41 [2018-01-21 10:39:52,843 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 10:39:52,844 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 10:39:52,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 10:39:52,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 10:39:52,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 10:39:52,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 10:39:52,845 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 10:39:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 10:39:52,845 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 10:39:52,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 10:39:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 10:39:52,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 10:39:52,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 10:39:52 BoogieIcfgContainer [2018-01-21 10:39:52,847 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 10:39:52,848 INFO L168 Benchmark]: Toolchain (without parser) took 2124.96 ms. Allocated memory was 302.0 MB in the beginning and 457.7 MB in the end (delta: 155.7 MB). Free memory was 259.3 MB in the beginning and 316.2 MB in the end (delta: -56.9 MB). Peak memory consumption was 98.8 MB. Max. memory is 5.3 GB. [2018-01-21 10:39:52,849 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 10:39:52,849 INFO L168 Benchmark]: CACSL2BoogieTranslator took 200.89 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 247.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. [2018-01-21 10:39:52,850 INFO L168 Benchmark]: Boogie Preprocessor took 38.17 ms. Allocated memory is still 302.0 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 10:39:52,850 INFO L168 Benchmark]: RCFGBuilder took 235.73 ms. Allocated memory is still 302.0 MB. Free memory was 245.1 MB in the beginning and 230.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-01-21 10:39:52,850 INFO L168 Benchmark]: TraceAbstraction took 1642.88 ms. Allocated memory was 302.0 MB in the beginning and 457.7 MB in the end (delta: 155.7 MB). Free memory was 230.5 MB in the beginning and 316.2 MB in the end (delta: -85.7 MB). Peak memory consumption was 70.1 MB. Max. memory is 5.3 GB. [2018-01-21 10:39:52,852 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 302.0 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 200.89 ms. Allocated memory is still 302.0 MB. Free memory was 259.3 MB in the beginning and 247.1 MB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 38.17 ms. Allocated memory is still 302.0 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 235.73 ms. Allocated memory is still 302.0 MB. Free memory was 245.1 MB in the beginning and 230.5 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1642.88 ms. Allocated memory was 302.0 MB in the beginning and 457.7 MB in the end (delta: 155.7 MB). Free memory was 230.5 MB in the beginning and 316.2 MB in the end (delta: -85.7 MB). Peak memory consumption was 70.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) - 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.1s 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)=3, \old(a8)=1, 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.0s 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_smtcomp.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_10-39-52-862.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_10-39-52-862.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_10-39-52-862.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_10-39-52-862.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_10-39-52-862.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_10-39-52-862.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_10-39-52-862.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_smtcomp.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_10-39-52-862.csv Received shutdown request...