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.epf -i ../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-20 23:27:19,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-20 23:27:19,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-20 23:27:19,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-20 23:27:19,093 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-20 23:27:19,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-20 23:27:19,094 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-20 23:27:19,095 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-20 23:27:19,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-20 23:27:19,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-20 23:27:19,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-20 23:27:19,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-20 23:27:19,100 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-20 23:27:19,102 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-20 23:27:19,103 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-20 23:27:19,105 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-20 23:27:19,108 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-20 23:27:19,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-20 23:27:19,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-20 23:27:19,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-20 23:27:19,114 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-20 23:27:19,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-20 23:27:19,115 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-20 23:27:19,116 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-20 23:27:19,117 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-20 23:27:19,118 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-20 23:27:19,118 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-20 23:27:19,119 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-20 23:27:19,119 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-20 23:27:19,119 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-20 23:27:19,120 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-20 23:27:19,120 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.epf [2018-01-20 23:27:19,130 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-20 23:27:19,131 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-20 23:27:19,131 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-20 23:27:19,131 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-20 23:27:19,132 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-20 23:27:19,132 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-20 23:27:19,132 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-20 23:27:19,133 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-20 23:27:19,133 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-20 23:27:19,133 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-20 23:27:19,133 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-20 23:27:19,133 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-20 23:27:19,134 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-20 23:27:19,134 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-20 23:27:19,134 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-20 23:27:19,134 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-20 23:27:19,134 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-20 23:27:19,135 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-20 23:27:19,135 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-20 23:27:19,135 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-20 23:27:19,135 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-20 23:27:19,135 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-20 23:27:19,136 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-20 23:27:19,136 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-20 23:27:19,136 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-20 23:27:19,136 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-20 23:27:19,137 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-20 23:27:19,137 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-20 23:27:19,137 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-20 23:27:19,137 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-20 23:27:19,137 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-20 23:27:19,137 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-20 23:27:19,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-20 23:27:19,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-20 23:27:19,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-20 23:27:19,138 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-20 23:27:19,139 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-20 23:27:19,139 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-20 23:27:19,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-20 23:27:19,186 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-20 23:27:19,190 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-20 23:27:19,192 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-20 23:27:19,192 INFO L276 PluginConnector]: CDTParser initialized [2018-01-20 23:27:19,193 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/960521-1_false-valid-free.i [2018-01-20 23:27:19,364 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-20 23:27:19,369 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-20 23:27:19,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-20 23:27:19,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-20 23:27:19,374 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-20 23:27:19,375 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4086764b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19, skipping insertion in model container [2018-01-20 23:27:19,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,394 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:27:19,434 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-20 23:27:19,548 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:27:19,562 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-20 23:27:19,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19 WrapperNode [2018-01-20 23:27:19,567 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-20 23:27:19,568 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-20 23:27:19,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-20 23:27:19,568 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-20 23:27:19,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,581 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,595 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,599 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,599 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (1/1) ... [2018-01-20 23:27:19,601 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-20 23:27:19,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-20 23:27:19,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-20 23:27:19,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-20 23:27:19,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (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-20 23:27:19,653 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-20 23:27:19,653 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-20 23:27:19,653 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-20 23:27:19,653 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-20 23:27:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-20 23:27:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-20 23:27:19,653 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-20 23:27:19,654 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-20 23:27:19,811 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-20 23:27:19,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:27:19 BoogieIcfgContainer [2018-01-20 23:27:19,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-20 23:27:19,813 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-20 23:27:19,813 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-20 23:27:19,815 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-20 23:27:19,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.01 11:27:19" (1/3) ... [2018-01-20 23:27:19,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:27:19, skipping insertion in model container [2018-01-20 23:27:19,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.01 11:27:19" (2/3) ... [2018-01-20 23:27:19,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729c1e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.01 11:27:19, skipping insertion in model container [2018-01-20 23:27:19,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.01 11:27:19" (3/3) ... [2018-01-20 23:27:19,818 INFO L105 eAbstractionObserver]: Analyzing ICFG 960521-1_false-valid-free.i [2018-01-20 23:27:19,825 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-20 23:27:19,830 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-01-20 23:27:19,876 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:27:19,876 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:27:19,876 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:27:19,876 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:27:19,876 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:27:19,877 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:27:19,877 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:27:19,877 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-20 23:27:19,878 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:27:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:27:19,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-01-20 23:27:19,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:19,905 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-01-20 23:27:19,905 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-20 23:27:19,910 INFO L82 PathProgramCache]: Analyzing trace with hash 90336, now seen corresponding path program 1 times [2018-01-20 23:27:19,913 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:19,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:19,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:19,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:19,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:27:20,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-20 23:27:20,055 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-20 23:27:20,062 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-20 23:27:20,072 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:27:20,072 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:27:20,072 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:27:20,072 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:27:20,072 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:27:20,073 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:27:20,073 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:27:20,073 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == fooErr0EnsuresViolation======== [2018-01-20 23:27:20,073 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:27:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:27:20,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-20 23:27:20,076 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:20,076 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-20 23:27:20,076 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr0EnsuresViolation]=== [2018-01-20 23:27:20,077 INFO L82 PathProgramCache]: Analyzing trace with hash 935443697, now seen corresponding path program 1 times [2018-01-20 23:27:20,077 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:20,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,078 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:20,078 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,078 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:27:20,113 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:27:20,156 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-20 23:27:20,158 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:27:20,159 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:27:20,159 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:27:20,161 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:27:20,171 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:27:20,172 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:27:20,174 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-20 23:27:20,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:27:20,257 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-20 23:27:20,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:27:20,259 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-01-20 23:27:20,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:27:20,265 INFO L225 Difference]: With dead ends: 60 [2018-01-20 23:27:20,265 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:27:20,268 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-20 23:27:20,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:27:20,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:27:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:27:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:27:20,287 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-20 23:27:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:27:20,288 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:27:20,288 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:27:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:27:20,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:27:20,290 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:27:20,291 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:27:20,291 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:27:20,291 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:27:20,291 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:27:20,291 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:27:20,291 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:27:20,291 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-20 23:27:20,292 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:27:20,293 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:27:20,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:27:20,295 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:20,295 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] [2018-01-20 23:27:20,295 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:27:20,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1172106943, now seen corresponding path program 1 times [2018-01-20 23:27:20,295 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:20,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,297 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:20,297 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,297 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:27:20,317 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:27:20,341 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-20 23:27:20,342 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:27:20,342 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:27:20,342 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:27:20,343 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:27:20,343 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:27:20,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:27:20,343 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-20 23:27:20,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:27:20,348 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-20 23:27:20,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:27:20,349 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-01-20 23:27:20,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:27:20,352 INFO L225 Difference]: With dead ends: 60 [2018-01-20 23:27:20,353 INFO L226 Difference]: Without dead ends: 36 [2018-01-20 23:27:20,353 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-20 23:27:20,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-20 23:27:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-20 23:27:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-20 23:27:20,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-20 23:27:20,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2018-01-20 23:27:20,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:27:20,364 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-20 23:27:20,364 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:27:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-20 23:27:20,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-20 23:27:20,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:20,366 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-20 23:27:20,366 INFO L371 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:27:20,366 INFO L82 PathProgramCache]: Analyzing trace with hash -862637837, now seen corresponding path program 1 times [2018-01-20 23:27:20,366 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:20,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,367 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:20,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:27:20,389 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:27:20,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-20 23:27:20,448 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:27:20,448 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:27:20,448 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:27:20,449 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:27:20,450 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:27:20,450 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:27:20,450 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 3 states. [2018-01-20 23:27:20,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:27:20,496 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-20 23:27:20,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:27:20,497 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-01-20 23:27:20,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:27:20,499 INFO L225 Difference]: With dead ends: 58 [2018-01-20 23:27:20,499 INFO L226 Difference]: Without dead ends: 45 [2018-01-20 23:27:20,500 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 23:27:20,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-20 23:27:20,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-01-20 23:27:20,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-20 23:27:20,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-01-20 23:27:20,506 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 29 [2018-01-20 23:27:20,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:27:20,506 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-01-20 23:27:20,507 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:27:20,507 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-01-20 23:27:20,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-20 23:27:20,508 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:20,508 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2018-01-20 23:27:20,508 INFO L371 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-20 23:27:20,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1162981958, now seen corresponding path program 1 times [2018-01-20 23:27:20,509 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:20,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,510 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:20,510 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,510 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:27:20,530 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:27:20,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:27:20,588 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:27:20,588 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:27:20,588 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:27:20,589 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:27:20,589 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:27:20,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:27:20,590 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-01-20 23:27:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:27:20,661 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-01-20 23:27:20,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:27:20,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-01-20 23:27:20,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:27:20,662 INFO L225 Difference]: With dead ends: 38 [2018-01-20 23:27:20,662 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:27:20,663 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:27:20,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:27:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:27:20,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:27:20,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:27:20,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2018-01-20 23:27:20,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:27:20,664 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:27:20,664 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:27:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:27:20,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:27:20,666 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-20 23:27:20,667 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-20 23:27:20,667 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-20 23:27:20,667 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-20 23:27:20,667 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-20 23:27:20,667 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-20 23:27:20,667 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-20 23:27:20,667 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-20 23:27:20,667 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-20 23:27:20,668 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-01-20 23:27:20,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-20 23:27:20,670 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:20,670 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] [2018-01-20 23:27:20,670 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-20 23:27:20,670 INFO L82 PathProgramCache]: Analyzing trace with hash -521684774, now seen corresponding path program 1 times [2018-01-20 23:27:20,670 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:20,671 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,671 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:20,672 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,672 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:27:20,682 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:27:20,695 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-20 23:27:20,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:27:20,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-20 23:27:20,695 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:27:20,696 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-20 23:27:20,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-20 23:27:20,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-20 23:27:20,696 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-01-20 23:27:20,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:27:20,700 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2018-01-20 23:27:20,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-20 23:27:20,700 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-01-20 23:27:20,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:27:20,701 INFO L225 Difference]: With dead ends: 60 [2018-01-20 23:27:20,701 INFO L226 Difference]: Without dead ends: 34 [2018-01-20 23:27:20,702 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-20 23:27:20,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-20 23:27:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-20 23:27:20,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-20 23:27:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2018-01-20 23:27:20,706 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 25 [2018-01-20 23:27:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:27:20,706 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2018-01-20 23:27:20,706 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-20 23:27:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2018-01-20 23:27:20,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-20 23:27:20,707 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:20,708 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] [2018-01-20 23:27:20,708 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation]=== [2018-01-20 23:27:20,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1567815694, now seen corresponding path program 1 times [2018-01-20 23:27:20,708 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:20,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,709 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:20,709 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,709 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:27:20,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:27:20,745 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-20 23:27:20,746 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:27:20,746 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-20 23:27:20,746 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:27:20,746 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-20 23:27:20,746 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-20 23:27:20,746 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-20 23:27:20,747 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand 3 states. [2018-01-20 23:27:20,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:27:20,765 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-01-20 23:27:20,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-20 23:27:20,765 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-01-20 23:27:20,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:27:20,767 INFO L225 Difference]: With dead ends: 54 [2018-01-20 23:27:20,767 INFO L226 Difference]: Without dead ends: 43 [2018-01-20 23:27:20,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-20 23:27:20,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-20 23:27:20,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2018-01-20 23:27:20,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-20 23:27:20,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2018-01-20 23:27:20,772 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 27 [2018-01-20 23:27:20,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:27:20,772 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2018-01-20 23:27:20,773 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-20 23:27:20,773 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-01-20 23:27:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-20 23:27:20,774 INFO L314 BasicCegarLoop]: Found error trace [2018-01-20 23:27:20,774 INFO L322 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2018-01-20 23:27:20,774 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation]=== [2018-01-20 23:27:20,774 INFO L82 PathProgramCache]: Analyzing trace with hash -890594667, now seen corresponding path program 1 times [2018-01-20 23:27:20,774 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-20 23:27:20,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,775 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-20 23:27:20,775 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-20 23:27:20,775 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-20 23:27:20,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-20 23:27:20,788 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-20 23:27:20,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-20 23:27:20,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-20 23:27:20,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-20 23:27:20,873 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-20 23:27:20,873 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-20 23:27:20,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-20 23:27:20,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-20 23:27:20,874 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 5 states. [2018-01-20 23:27:20,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-20 23:27:20,962 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-01-20 23:27:20,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-20 23:27:20,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-01-20 23:27:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-20 23:27:20,963 INFO L225 Difference]: With dead ends: 36 [2018-01-20 23:27:20,963 INFO L226 Difference]: Without dead ends: 0 [2018-01-20 23:27:20,964 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-20 23:27:20,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-20 23:27:20,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-20 23:27:20,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-20 23:27:20,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-20 23:27:20,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2018-01-20 23:27:20,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-20 23:27:20,964 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-20 23:27:20,964 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-20 23:27:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-20 23:27:20,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-20 23:27:20,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.01 11:27:20 BoogieIcfgContainer [2018-01-20 23:27:20,967 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-20 23:27:20,967 INFO L168 Benchmark]: Toolchain (without parser) took 1602.90 ms. Allocated memory was 306.2 MB in the beginning and 466.6 MB in the end (delta: 160.4 MB). Free memory was 266.1 MB in the beginning and 374.8 MB in the end (delta: -108.7 MB). Peak memory consumption was 51.8 MB. Max. memory is 5.3 GB. [2018-01-20 23:27:20,968 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-20 23:27:20,969 INFO L168 Benchmark]: CACSL2BoogieTranslator took 198.46 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. [2018-01-20 23:27:20,969 INFO L168 Benchmark]: Boogie Preprocessor took 32.59 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-20 23:27:20,969 INFO L168 Benchmark]: RCFGBuilder took 210.71 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 237.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. [2018-01-20 23:27:20,969 INFO L168 Benchmark]: TraceAbstraction took 1154.10 ms. Allocated memory was 306.2 MB in the beginning and 466.6 MB in the end (delta: 160.4 MB). Free memory was 237.0 MB in the beginning and 374.8 MB in the end (delta: -137.8 MB). Peak memory consumption was 22.7 MB. Max. memory is 5.3 GB. [2018-01-20 23:27:20,971 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.32 ms. Allocated memory is still 306.2 MB. Free memory is still 272.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 198.46 ms. Allocated memory is still 306.2 MB. Free memory was 265.1 MB in the beginning and 255.0 MB in the end (delta: 10.1 MB). Peak memory consumption was 10.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 32.59 ms. Allocated memory is still 306.2 MB. Free memory was 255.0 MB in the beginning and 254.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 210.71 ms. Allocated memory is still 306.2 MB. Free memory was 253.0 MB in the beginning and 237.0 MB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1154.10 ms. Allocated memory was 306.2 MB in the beginning and 466.6 MB in the end (delta: 160.4 MB). Free memory was 237.0 MB in the beginning and 374.8 MB in the end (delta: -137.8 MB). Peak memory consumption was 22.7 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) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=4, \old(a)=7, \old(b)=3, \old(b)=2, \old(n)=5, a={0:0}, b={0:0}, n=0] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. UNSAFE Result, 0.2s 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=40occurred 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: 621]: 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: fooErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 41 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 289 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: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. SAFE Result, 0.3s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 99 SDtfs, 30 SDslu, 81 SDs, 0 SdLazy, 28 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 89 NumberOfCodeBlocks, 89 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 86 ConstructedInterpolants, 0 QuantifiedInterpolants, 3300 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 629]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: mainErr0EnsuresViolation CFG has 4 procedures, 40 locations, 4 error locations. SAFE Result, 0.2s OverallTime, 3 OverallIterations, 2 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 97 SDtfs, 30 SDslu, 79 SDs, 0 SdLazy, 28 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 7 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 83 NumberOfCodeBlocks, 83 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 80 ConstructedInterpolants, 0 QuantifiedInterpolants, 2916 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2/2 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/960521-1_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-20_23-27-20-978.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-20_23-27-20-978.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-20_23-27-20-978.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-20_23-27-20-978.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-20_23-27-20-978.csv Received shutdown request...