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_imprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2f49842 [2018-01-21 00:55:21,695 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-21 00:55:21,697 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-21 00:55:21,714 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-21 00:55:21,715 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-21 00:55:21,716 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-21 00:55:21,717 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-21 00:55:21,720 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-21 00:55:21,722 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-21 00:55:21,723 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-21 00:55:21,723 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-21 00:55:21,724 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-21 00:55:21,724 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-21 00:55:21,725 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-21 00:55:21,726 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-21 00:55:21,729 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-21 00:55:21,731 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-21 00:55:21,733 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-21 00:55:21,735 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-21 00:55:21,736 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-21 00:55:21,739 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-21 00:55:21,739 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-21 00:55:21,739 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-21 00:55:21,740 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-21 00:55:21,741 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-21 00:55:21,743 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-21 00:55:21,743 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-21 00:55:21,744 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-21 00:55:21,744 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-21 00:55:21,744 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-21 00:55:21,745 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-21 00:55:21,745 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_imprecise.epf [2018-01-21 00:55:21,755 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-21 00:55:21,755 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-21 00:55:21,756 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-21 00:55:21,756 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-21 00:55:21,756 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-21 00:55:21,757 INFO L133 SettingsManager]: * Deactivate Weak Equivalences=true [2018-01-21 00:55:21,757 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-21 00:55:21,757 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-21 00:55:21,758 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-21 00:55:21,758 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-21 00:55:21,758 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-21 00:55:21,758 INFO L133 SettingsManager]: * Check allocation purity=true [2018-01-21 00:55:21,759 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-21 00:55:21,759 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-21 00:55:21,759 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-21 00:55:21,759 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-01-21 00:55:21,759 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-21 00:55:21,760 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-01-21 00:55:21,760 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-21 00:55:21,760 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-01-21 00:55:21,760 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-01-21 00:55:21,760 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-21 00:55:21,761 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-21 00:55:21,761 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-21 00:55:21,761 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-21 00:55:21,761 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-21 00:55:21,761 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-21 00:55:21,762 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-21 00:55:21,762 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-21 00:55:21,762 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-21 00:55:21,762 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-21 00:55:21,762 INFO L133 SettingsManager]: * Stop after first violation was found=false [2018-01-21 00:55:21,762 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-21 00:55:21,763 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-21 00:55:21,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-21 00:55:21,763 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-21 00:55:21,763 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-21 00:55:21,764 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-21 00:55:21,764 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-21 00:55:21,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-21 00:55:21,814 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-21 00:55:21,818 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-21 00:55:21,820 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-21 00:55:21,820 INFO L276 PluginConnector]: CDTParser initialized [2018-01-21 00:55:21,821 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test6_2_false-valid-free.i [2018-01-21 00:55:22,027 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-21 00:55:22,033 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-21 00:55:22,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-21 00:55:22,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-21 00:55:22,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-21 00:55:22,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28fcb04f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22, skipping insertion in model container [2018-01-21 00:55:22,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,066 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:55:22,118 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-21 00:55:22,240 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:55:22,262 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-21 00:55:22,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22 WrapperNode [2018-01-21 00:55:22,271 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-21 00:55:22,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-21 00:55:22,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-21 00:55:22,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-21 00:55:22,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,297 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,307 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (1/1) ... [2018-01-21 00:55:22,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-21 00:55:22,310 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-21 00:55:22,310 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-21 00:55:22,310 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-21 00:55:22,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (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 00:55:22,359 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-21 00:55:22,359 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-21 00:55:22,359 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-21 00:55:22,359 INFO L136 BoogieDeclarations]: Found implementation of procedure f6 [2018-01-21 00:55:22,359 INFO L136 BoogieDeclarations]: Found implementation of procedure g6 [2018-01-21 00:55:22,359 INFO L136 BoogieDeclarations]: Found implementation of procedure probe3_6 [2018-01-21 00:55:22,360 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_6 [2018-01-21 00:55:22,360 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-21 00:55:22,360 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-21 00:55:22,360 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-21 00:55:22,360 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-21 00:55:22,360 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-21 00:55:22,360 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-21 00:55:22,360 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-21 00:55:22,360 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-21 00:55:22,361 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-21 00:55:22,361 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-21 00:55:22,361 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-21 00:55:22,361 INFO L128 BoogieDeclarations]: Found specification of procedure f6 [2018-01-21 00:55:22,361 INFO L128 BoogieDeclarations]: Found specification of procedure g6 [2018-01-21 00:55:22,361 INFO L128 BoogieDeclarations]: Found specification of procedure probe3_6 [2018-01-21 00:55:22,362 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_6 [2018-01-21 00:55:22,362 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-21 00:55:22,362 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-21 00:55:22,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-21 00:55:22,362 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-21 00:55:22,593 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-21 00:55:22,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:55:22 BoogieIcfgContainer [2018-01-21 00:55:22,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-21 00:55:22,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-21 00:55:22,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-21 00:55:22,596 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-21 00:55:22,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.01 12:55:22" (1/3) ... [2018-01-21 00:55:22,597 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708e0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:55:22, skipping insertion in model container [2018-01-21 00:55:22,597 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.01 12:55:22" (2/3) ... [2018-01-21 00:55:22,598 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708e0ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.01 12:55:22, skipping insertion in model container [2018-01-21 00:55:22,598 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.01 12:55:22" (3/3) ... [2018-01-21 00:55:22,600 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test6_2_false-valid-free.i [2018-01-21 00:55:22,609 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-21 00:55:22,617 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-21 00:55:22,668 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:22,668 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:22,669 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:22,669 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:22,669 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:22,669 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:22,669 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:22,669 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == f6Err0EnsuresViolation======== [2018-01-21 00:55:22,670 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:22,691 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:22,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-21 00:55:22,698 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:22,699 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 00:55:22,700 INFO L371 AbstractCegarLoop]: === Iteration 1 === [f6Err0EnsuresViolation]=== [2018-01-21 00:55:22,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1410994878, now seen corresponding path program 1 times [2018-01-21 00:55:22,706 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:22,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:22,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:22,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:22,758 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:22,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:22,811 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:23,000 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 00:55:23,003 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:23,003 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:55:23,003 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:23,007 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:23,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:23,092 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,095 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:23,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:23,161 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:23,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:23,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-21 00:55:23,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:23,169 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:23,169 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:23,172 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:23,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:23,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:23,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:23,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2018-01-21 00:55:23,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:23,192 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:23,193 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:23,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:23,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:23,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:55:23,231 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:55:23,231 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:55:23,231 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1481) the Hoare annotation is: true [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,232 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1481) the Hoare annotation is: false [2018-01-21 00:55:23,232 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1479 1481) the Hoare annotation is: true [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1479 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1479 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1479 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1463 1465) the Hoare annotation is: true [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1463 1465) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1463 1465) no Hoare annotation was computed. [2018-01-21 00:55:23,233 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1463 1465) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point L1451'(line 1451) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point L1452(lines 1452 1453) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L404 ceAbstractionStarter]: At program point L1453(line 1453) the Hoare annotation is: true [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point L1445'(line 1445) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L404 ceAbstractionStarter]: At program point L1451(line 1451) the Hoare annotation is: true [2018-01-21 00:55:23,234 INFO L404 ceAbstractionStarter]: At program point probe3_6ENTRY(lines 1443 1461) the Hoare annotation is: true [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point L1459(line 1459) no Hoare annotation was computed. [2018-01-21 00:55:23,234 INFO L401 ceAbstractionStarter]: For program point probe3_6EXIT(lines 1443 1461) no Hoare annotation was computed. [2018-01-21 00:55:23,235 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-21 00:55:23,235 INFO L401 ceAbstractionStarter]: For program point L1448'(line 1448) no Hoare annotation was computed. [2018-01-21 00:55:23,235 INFO L401 ceAbstractionStarter]: For program point L1449(lines 1449 1450) no Hoare annotation was computed. [2018-01-21 00:55:23,235 INFO L404 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: true [2018-01-21 00:55:23,235 INFO L404 ceAbstractionStarter]: At program point L1445(line 1445) the Hoare annotation is: true [2018-01-21 00:55:23,235 INFO L401 ceAbstractionStarter]: For program point L1446(lines 1446 1447) no Hoare annotation was computed. [2018-01-21 00:55:23,235 INFO L401 ceAbstractionStarter]: For program point probe3_6Err0EnsuresViolation(lines 1443 1461) no Hoare annotation was computed. [2018-01-21 00:55:23,235 INFO L401 ceAbstractionStarter]: For program point probe3_6FINAL(lines 1443 1461) no Hoare annotation was computed. [2018-01-21 00:55:23,235 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1471 1477) the Hoare annotation is: true [2018-01-21 00:55:23,235 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1471 1477) no Hoare annotation was computed. [2018-01-21 00:55:23,236 INFO L401 ceAbstractionStarter]: For program point L1473'(lines 1473 1475) no Hoare annotation was computed. [2018-01-21 00:55:23,236 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1471 1477) no Hoare annotation was computed. [2018-01-21 00:55:23,236 INFO L404 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: true [2018-01-21 00:55:23,236 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1471 1477) no Hoare annotation was computed. [2018-01-21 00:55:23,236 INFO L401 ceAbstractionStarter]: For program point L1472(line 1472) no Hoare annotation was computed. [2018-01-21 00:55:23,236 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-21 00:55:23,236 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:55:23,237 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:55:23,237 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 00:55:23,237 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:55:23,240 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:23,240 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:23,240 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:23,240 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:23,240 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:23,240 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:23,240 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:23,240 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ldv_mallocErr0EnsuresViolation======== [2018-01-21 00:55:23,241 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:23,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-21 00:55:23,243 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:23,243 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:23,243 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ldv_mallocErr0EnsuresViolation]=== [2018-01-21 00:55:23,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1959972836, now seen corresponding path program 1 times [2018-01-21 00:55:23,243 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:23,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,245 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:23,245 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,245 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:23,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:23,260 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:23,336 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 00:55:23,337 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:23,337 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-21 00:55:23,337 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:23,337 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:23,338 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:23,338 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,338 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:23,359 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:23,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:23,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-21 00:55:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:23,360 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:23,360 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:23,361 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:23,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:23,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:23,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:23,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2018-01-21 00:55:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:23,361 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:23,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:23,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:23,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:23,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-21 00:55:23,380 INFO L404 ceAbstractionStarter]: At program point f6ENTRY(lines 1434 1436) the Hoare annotation is: true [2018-01-21 00:55:23,380 INFO L401 ceAbstractionStarter]: For program point f6Err0EnsuresViolation(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point f6FINAL(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point f6EXIT(lines 1434 1436) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L404 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: true [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point ldv_mallocErr0EnsuresViolation(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-21 00:55:23,381 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initErr0EnsuresViolation(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,382 INFO L401 ceAbstractionStarter]: For program point L1468(line 1468) no Hoare annotation was computed. [2018-01-21 00:55:23,382 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,382 INFO L401 ceAbstractionStarter]: For program point L1468'(line 1468) no Hoare annotation was computed. [2018-01-21 00:55:23,382 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1481) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-21 00:55:23,382 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,382 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1481) the Hoare annotation is: true [2018-01-21 00:55:23,382 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,382 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1481) the Hoare annotation is: false [2018-01-21 00:55:23,383 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startErr0EnsuresViolation(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,383 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,383 INFO L404 ceAbstractionStarter]: At program point mainENTRY(lines 1479 1481) the Hoare annotation is: true [2018-01-21 00:55:23,383 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1479 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,383 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1479 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,383 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1479 1481) no Hoare annotation was computed. [2018-01-21 00:55:23,383 INFO L401 ceAbstractionStarter]: For program point L1464''(line 1464) no Hoare annotation was computed. [2018-01-21 00:55:23,383 INFO L401 ceAbstractionStarter]: For program point L1464'(line 1464) no Hoare annotation was computed. [2018-01-21 00:55:23,383 INFO L404 ceAbstractionStarter]: At program point disconnect_6ENTRY(lines 1463 1465) the Hoare annotation is: true [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point disconnect_6Err0EnsuresViolation(lines 1463 1465) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point disconnect_6FINAL(lines 1463 1465) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point L1464(line 1464) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point disconnect_6EXIT(lines 1463 1465) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point L1451'(line 1451) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point L1454(line 1454) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point L1455(line 1455) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L401 ceAbstractionStarter]: For program point L1452(lines 1452 1453) no Hoare annotation was computed. [2018-01-21 00:55:23,384 INFO L404 ceAbstractionStarter]: At program point L1453(line 1453) the Hoare annotation is: true [2018-01-21 00:55:23,385 INFO L401 ceAbstractionStarter]: For program point L1445'(line 1445) no Hoare annotation was computed. [2018-01-21 00:55:23,385 INFO L404 ceAbstractionStarter]: At program point L1451(line 1451) the Hoare annotation is: true [2018-01-21 00:55:23,385 INFO L404 ceAbstractionStarter]: At program point probe3_6ENTRY(lines 1443 1461) the Hoare annotation is: true [2018-01-21 00:55:23,385 INFO L401 ceAbstractionStarter]: For program point L1459(line 1459) no Hoare annotation was computed. [2018-01-21 00:55:23,385 INFO L401 ceAbstractionStarter]: For program point probe3_6EXIT(lines 1443 1461) no Hoare annotation was computed. [2018-01-21 00:55:23,385 INFO L401 ceAbstractionStarter]: For program point L1454'(line 1454) no Hoare annotation was computed. [2018-01-21 00:55:23,385 INFO L401 ceAbstractionStarter]: For program point L1448'(line 1448) no Hoare annotation was computed. [2018-01-21 00:55:23,385 INFO L401 ceAbstractionStarter]: For program point L1449(lines 1449 1450) no Hoare annotation was computed. [2018-01-21 00:55:23,385 INFO L404 ceAbstractionStarter]: At program point L1448(line 1448) the Hoare annotation is: true [2018-01-21 00:55:23,385 INFO L404 ceAbstractionStarter]: At program point L1445(line 1445) the Hoare annotation is: true [2018-01-21 00:55:23,386 INFO L401 ceAbstractionStarter]: For program point L1446(lines 1446 1447) no Hoare annotation was computed. [2018-01-21 00:55:23,386 INFO L401 ceAbstractionStarter]: For program point probe3_6Err0EnsuresViolation(lines 1443 1461) no Hoare annotation was computed. [2018-01-21 00:55:23,386 INFO L401 ceAbstractionStarter]: For program point probe3_6FINAL(lines 1443 1461) no Hoare annotation was computed. [2018-01-21 00:55:23,386 INFO L404 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1471 1477) the Hoare annotation is: true [2018-01-21 00:55:23,386 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1471 1477) no Hoare annotation was computed. [2018-01-21 00:55:23,386 INFO L401 ceAbstractionStarter]: For program point L1473'(lines 1473 1475) no Hoare annotation was computed. [2018-01-21 00:55:23,386 INFO L401 ceAbstractionStarter]: For program point entry_pointErr0EnsuresViolation(lines 1471 1477) no Hoare annotation was computed. [2018-01-21 00:55:23,386 INFO L404 ceAbstractionStarter]: At program point L1474(line 1474) the Hoare annotation is: true [2018-01-21 00:55:23,387 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1471 1477) no Hoare annotation was computed. [2018-01-21 00:55:23,387 INFO L401 ceAbstractionStarter]: For program point L1472(line 1472) no Hoare annotation was computed. [2018-01-21 00:55:23,387 INFO L401 ceAbstractionStarter]: For program point L1473(lines 1473 1475) no Hoare annotation was computed. [2018-01-21 00:55:23,387 INFO L401 ceAbstractionStarter]: For program point g6EXIT(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:55:23,387 INFO L401 ceAbstractionStarter]: For program point g6FINAL(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:55:23,387 INFO L404 ceAbstractionStarter]: At program point g6ENTRY(lines 1438 1440) the Hoare annotation is: true [2018-01-21 00:55:23,387 INFO L401 ceAbstractionStarter]: For program point g6Err0EnsuresViolation(lines 1438 1440) no Hoare annotation was computed. [2018-01-21 00:55:23,389 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:23,389 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:23,390 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:23,390 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:23,390 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:23,390 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:23,390 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:23,390 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.initErr0EnsuresViolation======== [2018-01-21 00:55:23,390 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:23,392 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:23,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-01-21 00:55:23,393 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:23,393 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-01-21 00:55:23,393 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.initErr0EnsuresViolation]=== [2018-01-21 00:55:23,393 INFO L82 PathProgramCache]: Analyzing trace with hash 98448365, now seen corresponding path program 1 times [2018-01-21 00:55:23,393 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:23,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,395 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:23,395 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,395 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-21 00:55:23,429 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-21 00:55:23,434 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-21 00:55:23,438 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:55:23,438 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:55:23,439 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:55:23,439 WARN L1215 BoogieBacktranslator]: Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# [2018-01-21 00:55:23,442 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:23,442 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:23,442 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:23,443 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:23,443 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:23,443 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:23,443 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:23,443 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.startErr0EnsuresViolation======== [2018-01-21 00:55:23,443 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:23,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:55:23,447 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:23,447 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-21 00:55:23,447 INFO L371 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0EnsuresViolation]=== [2018-01-21 00:55:23,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1956254027, now seen corresponding path program 1 times [2018-01-21 00:55:23,447 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:23,448 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,448 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:23,449 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:23,462 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:23,535 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 00:55:23,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:23,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:55:23,535 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:23,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:23,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:23,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,536 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:23,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:23,566 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:23,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:23,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 00:55:23,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:23,567 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:23,567 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:23,568 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:23,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:23,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:23,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:23,569 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 00:55:23,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:23,569 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:23,569 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:23,569 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:23,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:23,570 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:23,571 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:23,571 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:23,571 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:23,571 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:23,571 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:23,571 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:23,571 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == mainErr0EnsuresViolation======== [2018-01-21 00:55:23,571 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:23,573 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:23,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-21 00:55:23,574 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:23,574 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-21 00:55:23,575 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation]=== [2018-01-21 00:55:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1052711786, now seen corresponding path program 1 times [2018-01-21 00:55:23,575 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:23,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,576 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:23,576 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,577 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:23,588 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:23,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-21 00:55:23,695 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:23,695 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:55:23,695 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:23,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:23,696 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:23,696 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,696 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:23,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:23,726 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:23,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:23,727 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-01-21 00:55:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:23,727 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:23,728 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:23,728 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:23,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:23,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:23,729 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-01-21 00:55:23,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:23,729 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:23,730 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:23,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:23,731 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:23,732 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:23,732 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:23,732 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:23,732 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:23,732 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:23,732 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:23,732 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == disconnect_6Err0EnsuresViolation======== [2018-01-21 00:55:23,732 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:23,734 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:23,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-21 00:55:23,735 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:23,735 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-21 00:55:23,736 INFO L371 AbstractCegarLoop]: === Iteration 1 === [disconnect_6Err0EnsuresViolation]=== [2018-01-21 00:55:23,736 INFO L82 PathProgramCache]: Analyzing trace with hash 120917909, now seen corresponding path program 1 times [2018-01-21 00:55:23,736 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:23,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,738 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:23,738 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,738 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:23,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:23,750 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:23,810 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 00:55:23,810 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:23,810 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:55:23,810 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:23,811 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:23,811 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:23,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,811 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:23,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:23,838 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:23,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:23,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2018-01-21 00:55:23,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:23,839 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:23,839 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:23,839 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:23,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:23,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:23,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:23,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-01-21 00:55:23,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:23,840 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:23,840 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:23,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:23,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:23,841 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:23,842 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:23,842 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:23,842 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:23,842 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:23,842 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:23,842 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:23,842 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == probe3_6Err0EnsuresViolation======== [2018-01-21 00:55:23,842 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:23,843 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-21 00:55:23,844 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:23,844 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:23,844 INFO L371 AbstractCegarLoop]: === Iteration 1 === [probe3_6Err0EnsuresViolation]=== [2018-01-21 00:55:23,844 INFO L82 PathProgramCache]: Analyzing trace with hash 762776652, now seen corresponding path program 1 times [2018-01-21 00:55:23,844 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:23,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:23,845 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,845 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:23,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:23,854 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:23,943 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 00:55:23,944 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:23,944 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:55:23,944 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:23,945 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:23,945 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:23,945 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,945 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:23,964 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:23,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:23,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-01-21 00:55:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:23,965 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:23,965 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:23,966 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:23,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:23,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:23,967 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2018-01-21 00:55:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:23,967 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:23,967 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:23,967 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:23,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:23,968 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:23,968 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:23,968 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:23,969 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:23,969 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:23,969 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:23,969 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:23,969 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == entry_pointErr0EnsuresViolation======== [2018-01-21 00:55:23,969 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:23,970 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:23,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-21 00:55:23,971 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:23,971 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-21 00:55:23,971 INFO L371 AbstractCegarLoop]: === Iteration 1 === [entry_pointErr0EnsuresViolation]=== [2018-01-21 00:55:23,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1545271565, now seen corresponding path program 1 times [2018-01-21 00:55:23,971 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:23,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,973 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:23,973 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:23,973 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:23,983 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:24,041 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 00:55:24,042 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:24,042 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:55:24,042 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:24,042 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:24,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:24,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:24,043 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:24,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:24,076 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:24,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:24,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-01-21 00:55:24,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:24,077 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:24,077 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:24,077 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:24,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:24,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:24,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:24,079 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2018-01-21 00:55:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:24,079 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:24,079 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:24,079 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:24,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:24,080 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-21 00:55:24,081 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-21 00:55:24,081 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-21 00:55:24,081 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-21 00:55:24,081 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-21 00:55:24,081 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-21 00:55:24,081 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-21 00:55:24,081 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == g6Err0EnsuresViolation======== [2018-01-21 00:55:24,081 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-21 00:55:24,082 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-01-21 00:55:24,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-21 00:55:24,084 INFO L314 BasicCegarLoop]: Found error trace [2018-01-21 00:55:24,084 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 00:55:24,084 INFO L371 AbstractCegarLoop]: === Iteration 1 === [g6Err0EnsuresViolation]=== [2018-01-21 00:55:24,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1917157345, now seen corresponding path program 1 times [2018-01-21 00:55:24,084 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-21 00:55:24,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:24,086 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-21 00:55:24,086 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-21 00:55:24,086 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-21 00:55:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-21 00:55:24,094 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-21 00:55:24,182 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 00:55:24,182 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-21 00:55:24,182 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-21 00:55:24,182 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-21 00:55:24,183 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-21 00:55:24,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-21 00:55:24,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:24,183 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 6 states. [2018-01-21 00:55:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-21 00:55:24,200 INFO L93 Difference]: Finished difference Result 63 states and 67 transitions. [2018-01-21 00:55:24,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-21 00:55:24,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-01-21 00:55:24,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-21 00:55:24,201 INFO L225 Difference]: With dead ends: 63 [2018-01-21 00:55:24,201 INFO L226 Difference]: Without dead ends: 0 [2018-01-21 00:55:24,202 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-21 00:55:24,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-21 00:55:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-21 00:55:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-21 00:55:24,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-21 00:55:24,202 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-21 00:55:24,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-21 00:55:24,202 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-21 00:55:24,203 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-21 00:55:24,203 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-21 00:55:24,203 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-21 00:55:24,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.01 12:55:24 BoogieIcfgContainer [2018-01-21 00:55:24,205 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-21 00:55:24,206 INFO L168 Benchmark]: Toolchain (without parser) took 2178.02 ms. Allocated memory was 303.0 MB in the beginning and 457.7 MB in the end (delta: 154.7 MB). Free memory was 260.4 MB in the beginning and 313.2 MB in the end (delta: -52.8 MB). Peak memory consumption was 101.8 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:24,207 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 303.0 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-21 00:55:24,207 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.93 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 247.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:24,208 INFO L168 Benchmark]: Boogie Preprocessor took 37.54 ms. Allocated memory is still 303.0 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:24,208 INFO L168 Benchmark]: RCFGBuilder took 284.17 ms. Allocated memory is still 303.0 MB. Free memory was 245.1 MB in the beginning and 226.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:24,208 INFO L168 Benchmark]: TraceAbstraction took 1610.74 ms. Allocated memory was 303.0 MB in the beginning and 457.7 MB in the end (delta: 154.7 MB). Free memory was 226.5 MB in the beginning and 313.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 67.9 MB. Max. memory is 5.3 GB. [2018-01-21 00:55:24,210 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 303.0 MB. Free memory is still 267.4 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 237.93 ms. Allocated memory is still 303.0 MB. Free memory was 260.4 MB in the beginning and 247.1 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 37.54 ms. Allocated memory is still 303.0 MB. Free memory was 247.1 MB in the beginning and 245.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 284.17 ms. Allocated memory is still 303.0 MB. Free memory was 245.1 MB in the beginning and 226.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1610.74 ms. Allocated memory was 303.0 MB in the beginning and 457.7 MB in the end (delta: 154.7 MB). Free memory was 226.5 MB in the beginning and 313.2 MB in the end (delta: -86.8 MB). Peak memory consumption was 67.9 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 8 could not be translated for associated CType STRUCT#?p~$Pointer$# - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IntegerLiteral 5 could not be translated for associated CType STRUCT#?p~$Pointer$# * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1434]: 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: f6Err0EnsuresViolation CFG has 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.5s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 19 ConstructedInterpolants, 0 QuantifiedInterpolants, 988 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: 1072]: 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: ldv_mallocErr0EnsuresViolation CFG has 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 15 PreInvPairs, 15 NumberOfFragments, 17 HoareAnnotationTreeSize, 15 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 598 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: IVAL [\old(a6)=null, \old(a6)=null, a6={8:5}] [L1468] FCALL struct A a6; VAL [\old(a6)=null, \old(a6)=null, a6={7:0}] - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.initErr0EnsuresViolation CFG has 9 procedures, 63 locations, 9 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=63occurred 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, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available - PositiveResult [Line: 1]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data for error location: ULTIMATE.startErr0EnsuresViolation CFG has 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 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: 1479]: 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 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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.1s InterpolantComputationTime, 25 NumberOfCodeBlocks, 25 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 24 ConstructedInterpolants, 0 QuantifiedInterpolants, 1368 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: 1463]: 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: disconnect_6Err0EnsuresViolation CFG has 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 1534 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: 1443]: 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: probe3_6Err0EnsuresViolation CFG has 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 12 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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, 850 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: 1471]: 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 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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, 23 NumberOfCodeBlocks, 23 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 1210 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: 1438]: 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: g6Err0EnsuresViolation CFG has 9 procedures, 63 locations, 9 error locations. SAFE Result, 0.1s OverallTime, 1 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1 SDtfs, 2 SDslu, 0 SDs, 0 SdLazy, 15 SolverSat, 2 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred 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, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 25 ConstructedInterpolants, 0 QuantifiedInterpolants, 1450 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 - InvariantResult [Line: 1453]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be incorrect! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-1-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-2-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-3-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-4-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-5-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-6-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-7-2018-01-21_00-55-24-221.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test6_2_false-valid-free.i_mempurity-32bit-Automizer_Taipan+AI_EQ_imprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-8-2018-01-21_00-55-24-221.csv Received shutdown request...