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_test17_1_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 03:28:44,825 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 03:28:44,828 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 03:28:44,852 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 03:28:44,852 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 03:28:44,853 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 03:28:44,855 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 03:28:44,859 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 03:28:44,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 03:28:44,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 03:28:44,862 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 03:28:44,862 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 03:28:44,863 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 03:28:44,864 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 03:28:44,865 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 03:28:44,874 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 03:28:44,876 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 03:28:44,877 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 03:28:44,878 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 03:28:44,879 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 03:28:44,881 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 03:28:44,881 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 03:28:44,882 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 03:28:44,883 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 03:28:44,884 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 03:28:44,885 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 03:28:44,885 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 03:28:44,886 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 03:28:44,891 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 03:28:44,891 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 03:28:44,892 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 03:28:44,892 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:28:44,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 03:28:44,908 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 03:28:44,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 03:28:44,909 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 03:28:44,909 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 03:28:44,909 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-21 03:28:44,909 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 03:28:44,909 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-21 03:28:44,909 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 03:28:44,910 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 03:28:44,910 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 03:28:44,910 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 03:28:44,911 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 03:28:44,911 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 03:28:44,911 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 03:28:44,912 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 03:28:44,912 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 03:28:44,912 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 03:28:44,912 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 03:28:44,912 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 03:28:44,912 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 03:28:44,913 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 03:28:44,913 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 03:28:44,913 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 03:28:44,913 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 03:28:44,913 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 03:28:44,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 03:28:44,914 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 03:28:44,914 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 03:28:44,914 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 03:28:44,914 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 03:28:44,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 03:28:44,914 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 03:28:44,915 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 03:28:44,915 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 03:28:44,915 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 03:28:44,917 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 03:28:44,917 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 03:28:44,918 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 03:28:44,918 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 03:28:44,960 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 03:28:44,971 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 03:28:44,975 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 03:28:44,977 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 03:28:44,977 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 03:28:44,978 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test17_1_false-valid-memtrack.i [2018-01-21 03:28:45,193 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 03:28:45,198 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 03:28:45,199 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 03:28:45,199 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 03:28:45,207 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 03:28:45,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a2844af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45, skipping insertion in model container [2018-01-21 03:28:45,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,226 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:28:45,278 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 03:28:45,432 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:28:45,453 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 03:28:45,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45 WrapperNode [2018-01-21 03:28:45,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 03:28:45,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 03:28:45,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 03:28:45,468 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 03:28:45,494 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,504 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,504 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,508 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,513 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (1/1) ... [2018-01-21 03:28:45,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 03:28:45,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 03:28:45,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 03:28:45,515 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 03:28:45,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (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:28:45,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 03:28:45,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 03:28:45,609 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 03:28:45,609 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_17 [2018-01-21 03:28:45,610 INFO L136 BoogieDeclarations]: Found implementation of procedure free_17 [2018-01-21 03:28:45,610 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 03:28:45,610 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 03:28:45,610 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 03:28:45,610 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 03:28:45,610 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 03:28:45,611 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 03:28:45,611 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 03:28:45,611 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 03:28:45,611 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 03:28:45,611 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 03:28:45,611 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 03:28:45,611 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_17 [2018-01-21 03:28:45,612 INFO L128 BoogieDeclarations]: Found specification of procedure free_17 [2018-01-21 03:28:45,612 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 03:28:45,612 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 03:28:45,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 03:28:45,612 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 03:28:46,032 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 03:28:46,033 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:28:46 BoogieIcfgContainer [2018-01-21 03:28:46,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 03:28:46,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 03:28:46,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 03:28:46,036 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 03:28:46,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 03:28:45" (1/3) ... [2018-01-21 03:28:46,037 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1140a7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:28:46, skipping insertion in model container [2018-01-21 03:28:46,037 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 03:28:45" (2/3) ... [2018-01-21 03:28:46,038 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1140a7e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 03:28:46, skipping insertion in model container [2018-01-21 03:28:46,038 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 03:28:46" (3/3) ... [2018-01-21 03:28:46,039 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test17_1_false-valid-memtrack.i [2018-01-21 03:28:46,046 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 03:28:46,053 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-21 03:28:46,109 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:46,109 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:46,110 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:46,110 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:46,110 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:46,110 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:46,110 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:46,110 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 03:28:46,111 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:46,126 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 03:28:46,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-21 03:28:46,131 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:46,132 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:46,132 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:28:46,136 INFO L82 PathProgramCache]: Analyzing trace with hash 441029511, now seen corresponding path program 1 times [2018-01-21 03:28:46,137 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:46,186 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,186 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:46,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,187 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:46,237 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:46,289 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:28:46,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:46,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:46,292 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:46,295 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:28:46,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:28:46,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:28:46,311 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 03:28:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:46,622 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 03:28:46,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:28:46,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-01-21 03:28:46,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:46,631 INFO L225 Difference]: With dead ends: 125 [2018-01-21 03:28:46,631 INFO L226 Difference]: Without dead ends: 31 [2018-01-21 03:28:46,635 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:28:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-01-21 03:28:46,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-01-21 03:28:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-21 03:28:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-01-21 03:28:46,669 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 11 [2018-01-21 03:28:46,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:46,670 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-01-21 03:28:46,670 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:28:46,670 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-01-21 03:28:46,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-21 03:28:46,672 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:46,673 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:46,673 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 03:28:46,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1372495191, now seen corresponding path program 1 times [2018-01-21 03:28:46,673 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:46,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,675 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:46,675 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,676 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:46,738 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:28:46,746 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:46,747 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:46,759 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:46,759 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:46,759 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:46,759 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:46,759 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:46,759 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:46,759 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:46,759 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 03:28:46,760 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:46,762 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 03:28:46,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-21 03:28:46,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:46,762 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-21 03:28:46,762 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 03:28:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash 141653, now seen corresponding path program 1 times [2018-01-21 03:28:46,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:46,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:46,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:46,773 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:28:46,773 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:46,775 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:46,775 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:46,775 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:46,775 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:46,776 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:46,776 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:46,776 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:46,776 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == alloc_17Err0EnsuresViolation======== [2018-01-21 03:28:46,776 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 03:28:46,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 03:28:46,779 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:46,779 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] [2018-01-21 03:28:46,779 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 03:28:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1541289171, now seen corresponding path program 1 times [2018-01-21 03:28:46,779 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:46,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,781 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:46,781 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,781 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:46,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:46,795 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:46,816 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:28:46,816 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:46,816 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:46,817 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:46,817 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:28:46,817 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:28:46,817 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:28:46,818 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 03:28:46,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:46,827 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-01-21 03:28:46,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:28:46,827 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-01-21 03:28:46,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:46,828 INFO L225 Difference]: With dead ends: 115 [2018-01-21 03:28:46,828 INFO L226 Difference]: Without dead ends: 41 [2018-01-21 03:28:46,829 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:28:46,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-21 03:28:46,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-21 03:28:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-21 03:28:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-01-21 03:28:46,836 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 20 [2018-01-21 03:28:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:46,838 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-01-21 03:28:46,838 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:28:46,839 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-01-21 03:28:46,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-21 03:28:46,839 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:46,840 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:46,840 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 03:28:46,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1909953208, now seen corresponding path program 1 times [2018-01-21 03:28:46,840 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:46,841 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:46,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:46,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:46,859 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:46,938 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:28:46,939 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:46,939 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:28:46,939 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:46,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:28:46,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:28:46,940 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:28:46,940 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-01-21 03:28:46,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:46,955 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2018-01-21 03:28:46,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:28:46,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-21 03:28:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:46,958 INFO L225 Difference]: With dead ends: 76 [2018-01-21 03:28:46,958 INFO L226 Difference]: Without dead ends: 43 [2018-01-21 03:28:46,960 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:28:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-21 03:28:46,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-21 03:28:46,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-21 03:28:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-01-21 03:28:46,966 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 22 [2018-01-21 03:28:46,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:46,967 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-01-21 03:28:46,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:28:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-01-21 03:28:46,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-21 03:28:46,968 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:46,968 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:46,969 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_17Err0EnsuresViolation]=== [2018-01-21 03:28:46,969 INFO L82 PathProgramCache]: Analyzing trace with hash -30329626, now seen corresponding path program 1 times [2018-01-21 03:28:46,969 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:46,970 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,971 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:46,971 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:46,971 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:46,989 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:47,029 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:28:47,029 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:47,029 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:28:47,029 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:47,030 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:28:47,030 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:28:47,030 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:28:47,030 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-01-21 03:28:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:47,052 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-01-21 03:28:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:28:47,053 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-21 03:28:47,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:47,053 INFO L225 Difference]: With dead ends: 50 [2018-01-21 03:28:47,053 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:28:47,054 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:28:47,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:28:47,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:28:47,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:28:47,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:28:47,055 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2018-01-21 03:28:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:47,055 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:28:47,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:28:47,056 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:28:47,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:28:47,059 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:47,059 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:47,059 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:47,059 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:47,059 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:47,059 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:47,059 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:47,059 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 03:28:47,060 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:47,061 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 03:28:47,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-21 03:28:47,063 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:47,063 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:28:47,063 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 03:28:47,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1549449137, now seen corresponding path program 1 times [2018-01-21 03:28:47,063 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:47,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,065 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:47,065 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,065 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:47,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 03:28:47,089 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 03:28:47,092 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:47,092 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:47,093 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:47,093 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:47,094 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 03:28:47,097 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:47,097 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:47,097 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:47,097 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:47,097 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:47,097 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:47,098 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:47,098 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 03:28:47,098 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 03:28:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-21 03:28:47,100 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:47,100 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:47,100 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 03:28:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash 931220233, now seen corresponding path program 1 times [2018-01-21 03:28:47,101 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:47,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,102 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:47,102 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,103 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:47,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:28:47,133 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:47,134 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:47,134 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:47,134 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:28:47,134 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:28:47,134 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:28:47,134 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 03:28:47,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:47,328 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 03:28:47,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:28:47,329 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-01-21 03:28:47,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:47,329 INFO L225 Difference]: With dead ends: 125 [2018-01-21 03:28:47,329 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:28:47,330 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:28:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:28:47,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:28:47,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:28:47,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:28:47,331 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2018-01-21 03:28:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:47,332 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:28:47,332 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:28:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:28:47,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:28:47,335 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:47,335 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:47,335 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:47,335 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:47,335 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:47,336 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:47,336 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:47,336 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == free_17Err0EnsuresViolation======== [2018-01-21 03:28:47,336 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 03:28:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 03:28:47,338 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:47,338 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:47,338 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_17Err0EnsuresViolation]=== [2018-01-21 03:28:47,339 INFO L82 PathProgramCache]: Analyzing trace with hash 2119379531, now seen corresponding path program 1 times [2018-01-21 03:28:47,339 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:47,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,340 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:47,340 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,341 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:47,350 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:47,365 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:28:47,365 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:47,365 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:47,366 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:47,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-21 03:28:47,366 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-21 03:28:47,366 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:28:47,367 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-01-21 03:28:47,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:47,371 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-01-21 03:28:47,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-21 03:28:47,371 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 26 [2018-01-21 03:28:47,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:47,372 INFO L225 Difference]: With dead ends: 115 [2018-01-21 03:28:47,373 INFO L226 Difference]: Without dead ends: 52 [2018-01-21 03:28:47,374 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-21 03:28:47,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-21 03:28:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-01-21 03:28:47,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-01-21 03:28:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 58 transitions. [2018-01-21 03:28:47,382 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 58 transitions. Word has length 26 [2018-01-21 03:28:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:47,382 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 58 transitions. [2018-01-21 03:28:47,382 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-21 03:28:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-01-21 03:28:47,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-21 03:28:47,383 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:47,384 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:47,384 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_17Err0EnsuresViolation]=== [2018-01-21 03:28:47,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1908262188, now seen corresponding path program 1 times [2018-01-21 03:28:47,384 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:47,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,385 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:47,385 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,385 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:47,396 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:47,447 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:28:47,447 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:47,447 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 03:28:47,448 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:47,448 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-21 03:28:47,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-21 03:28:47,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:28:47,449 INFO L87 Difference]: Start difference. First operand 52 states and 58 transitions. Second operand 5 states. [2018-01-21 03:28:47,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:47,483 INFO L93 Difference]: Finished difference Result 98 states and 110 transitions. [2018-01-21 03:28:47,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 03:28:47,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-21 03:28:47,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:47,485 INFO L225 Difference]: With dead ends: 98 [2018-01-21 03:28:47,485 INFO L226 Difference]: Without dead ends: 54 [2018-01-21 03:28:47,485 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-21 03:28:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-21 03:28:47,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-21 03:28:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-21 03:28:47,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-01-21 03:28:47,491 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 29 [2018-01-21 03:28:47,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:47,491 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-01-21 03:28:47,492 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-21 03:28:47,492 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-01-21 03:28:47,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-21 03:28:47,493 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:47,494 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:47,494 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_17Err0EnsuresViolation]=== [2018-01-21 03:28:47,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1407892106, now seen corresponding path program 1 times [2018-01-21 03:28:47,494 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:47,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,496 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:47,496 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,496 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:47,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:47,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-21 03:28:47,537 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:47,537 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-21 03:28:47,537 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:47,538 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-21 03:28:47,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-21 03:28:47,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-21 03:28:47,539 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 4 states. [2018-01-21 03:28:47,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:47,560 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-01-21 03:28:47,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-21 03:28:47,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-01-21 03:28:47,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:47,561 INFO L225 Difference]: With dead ends: 61 [2018-01-21 03:28:47,562 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:28:47,562 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:28:47,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:28:47,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:28:47,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:28:47,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:28:47,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-21 03:28:47,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:47,564 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:28:47,564 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-21 03:28:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:28:47,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:28:47,566 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 03:28:47,566 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 03:28:47,566 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 03:28:47,566 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 03:28:47,566 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 03:28:47,566 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 03:28:47,567 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 03:28:47,567 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 03:28:47,567 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 03:28:47,568 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-01-21 03:28:47,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-21 03:28:47,569 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 03:28:47,569 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 03:28:47,569 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 03:28:47,569 INFO L82 PathProgramCache]: Analyzing trace with hash -320818343, now seen corresponding path program 1 times [2018-01-21 03:28:47,570 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 03:28:47,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,571 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 03:28:47,571 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 03:28:47,571 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 03:28:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 03:28:47,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 03:28:47,596 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:28:47,597 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 03:28:47,597 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-21 03:28:47,597 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 03:28:47,597 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-21 03:28:47,597 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-21 03:28:47,598 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-21 03:28:47,598 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 3 states. [2018-01-21 03:28:47,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 03:28:47,658 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2018-01-21 03:28:47,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-21 03:28:47,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-21 03:28:47,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 03:28:47,658 INFO L225 Difference]: With dead ends: 125 [2018-01-21 03:28:47,659 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 03:28:47,659 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:28:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 03:28:47,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 03:28:47,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 03:28:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 03:28:47,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-01-21 03:28:47,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 03:28:47,660 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 03:28:47,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-21 03:28:47,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 03:28:47,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 03:28:47,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 03:28:47 BoogieIcfgContainer [2018-01-21 03:28:47,662 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 03:28:47,663 INFO L168 Benchmark]: Toolchain (without parser) took 2469.09 ms. Allocated memory was 301.5 MB in the beginning and 454.6 MB in the end (delta: 153.1 MB). Free memory was 258.6 MB in the beginning and 317.2 MB in the end (delta: -58.6 MB). Peak memory consumption was 94.5 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:47,664 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 301.5 MB. Free memory is still 264.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 03:28:47,665 INFO L168 Benchmark]: CACSL2BoogieTranslator took 268.37 ms. Allocated memory is still 301.5 MB. Free memory was 258.6 MB in the beginning and 244.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:47,665 INFO L168 Benchmark]: Boogie Preprocessor took 46.71 ms. Allocated memory is still 301.5 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:47,665 INFO L168 Benchmark]: RCFGBuilder took 518.31 ms. Allocated memory is still 301.5 MB. Free memory was 242.6 MB in the beginning and 221.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:47,665 INFO L168 Benchmark]: TraceAbstraction took 1628.14 ms. Allocated memory was 301.5 MB in the beginning and 454.6 MB in the end (delta: 153.1 MB). Free memory was 221.5 MB in the beginning and 317.2 MB in the end (delta: -95.7 MB). Peak memory consumption was 57.3 MB. Max. memory is 5.3 GB. [2018-01-21 03:28:47,667 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 301.5 MB. Free memory is still 264.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 268.37 ms. Allocated memory is still 301.5 MB. Free memory was 258.6 MB in the beginning and 244.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 46.71 ms. Allocated memory is still 301.5 MB. Free memory was 244.6 MB in the beginning and 242.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 518.31 ms. Allocated memory is still 301.5 MB. Free memory was 242.6 MB in the beginning and 221.5 MB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1628.14 ms. Allocated memory was 301.5 MB in the beginning and 454.6 MB in the end (delta: 153.1 MB). Free memory was 221.5 MB in the beginning and 317.2 MB in the end (delta: -95.7 MB). Peak memory consumption was 57.3 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1072]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND TRUE __VERIFIER_nondet_int() [L1074] EXPR, FCALL malloc(size) VAL [\old(size)=40, malloc(size)={42:0}, size=40] [L1074] return malloc(size); VAL [\old(size)=40, \result={42:0}, malloc(size)={42:0}, size=40] - StatisticsResult: Ultimate Automizer benchmark data for error location: ldv_mallocErr0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. UNSAFE Result, 0.6s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 37 SDslu, 15 SDs, 0 SdLazy, 25 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 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: - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 7 procedures, 65 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 3 NumberOfCodeBlocks, 3 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1439]: 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_17Err0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 128 SDtfs, 3 SDslu, 136 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 63 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 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: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1478] CALL entry_point() [L1465] int i; [L1466] int len = 10; VAL [len=10] [L1467] CALL, EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [\old(size)=40] [L1073] COND FALSE !(__VERIFIER_nondet_int()) [L1076] RET return 0; VAL [\old(size)=40, \result={0:0}, size=40] [L1467] EXPR ldv_malloc(sizeof(struct A17*)*len) VAL [ldv_malloc(sizeof(struct A17*)*len)={0:0}, len=10] [L1467] struct A17 **array = (struct A17 **)ldv_malloc(sizeof(struct A17*)*len); [L1468] COND TRUE, RET !array VAL [array={0:0}, len=10] [L1478] entry_point() - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 7 procedures, 65 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 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: 1477]: 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, 65 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 32 SDslu, 15 SDs, 0 SdLazy, 25 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 16 ConstructedInterpolants, 0 QuantifiedInterpolants, 640 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 - PositiveResult [Line: 1457]: 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_17Err0EnsuresViolation CFG has 7 procedures, 65 locations, 7 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 140 SDtfs, 3 SDslu, 172 SDs, 0 SdLazy, 21 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 83 ConstructedInterpolants, 0 QuantifiedInterpolants, 3341 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1464]: 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, 65 locations, 7 error locations. SAFE Result, 0.0s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 56 SDtfs, 33 SDslu, 15 SDs, 0 SdLazy, 25 SolverSat, 18 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=65occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 14 ConstructedInterpolants, 0 QuantifiedInterpolants, 448 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 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_03-28-47-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_03-28-47-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_03-28-47-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_03-28-47-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_03-28-47-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_03-28-47-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_03-28-47-676.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test17_1_false-valid-memtrack.i_mempurity-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_03-28-47-676.csv Received shutdown request...