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/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test3_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-30 00:20:01,253 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-30 00:20:01,254 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-30 00:20:01,267 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-30 00:20:01,267 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-30 00:20:01,268 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-30 00:20:01,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-30 00:20:01,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-30 00:20:01,274 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-30 00:20:01,274 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-30 00:20:01,275 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-30 00:20:01,275 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-30 00:20:01,276 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-30 00:20:01,277 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-30 00:20:01,278 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-30 00:20:01,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-30 00:20:01,283 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-30 00:20:01,285 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-30 00:20:01,286 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-30 00:20:01,287 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-30 00:20:01,290 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-30 00:20:01,290 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-30 00:20:01,290 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-30 00:20:01,291 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-30 00:20:01,292 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-30 00:20:01,294 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-30 00:20:01,294 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-30 00:20:01,295 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-30 00:20:01,295 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-30 00:20:01,295 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-30 00:20:01,296 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-30 00:20:01,296 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-30 00:20:01,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-30 00:20:01,306 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-30 00:20:01,307 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-30 00:20:01,307 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-30 00:20:01,307 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-30 00:20:01,308 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-30 00:20:01,308 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-30 00:20:01,308 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-30 00:20:01,309 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-30 00:20:01,309 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-30 00:20:01,309 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-30 00:20:01,309 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-30 00:20:01,309 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-30 00:20:01,309 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-30 00:20:01,310 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-30 00:20:01,310 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-30 00:20:01,310 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-30 00:20:01,310 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-30 00:20:01,310 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-30 00:20:01,311 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-30 00:20:01,311 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-30 00:20:01,311 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-30 00:20:01,311 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-30 00:20:01,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-30 00:20:01,312 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-30 00:20:01,312 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-30 00:20:01,312 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-30 00:20:01,312 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-30 00:20:01,312 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-30 00:20:01,312 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-30 00:20:01,313 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-30 00:20:01,313 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-30 00:20:01,314 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-30 00:20:01,314 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-30 00:20:01,350 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-30 00:20:01,364 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-30 00:20:01,368 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-30 00:20:01,370 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-30 00:20:01,370 INFO L276 PluginConnector]: CDTParser initialized [2018-01-30 00:20:01,371 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test3_true-valid-memsafety_true-termination.i [2018-01-30 00:20:01,574 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-30 00:20:01,581 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-30 00:20:01,582 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:01,582 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-30 00:20:01,589 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-30 00:20:01,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7acb6c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01, skipping insertion in model container [2018-01-30 00:20:01,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,617 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:01,690 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-30 00:20:01,829 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:01,841 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-30 00:20:01,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01 WrapperNode [2018-01-30 00:20:01,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-30 00:20:01,847 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-30 00:20:01,847 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-30 00:20:01,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-30 00:20:01,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,869 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (1/1) ... [2018-01-30 00:20:01,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-30 00:20:01,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-30 00:20:01,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-30 00:20:01,881 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-30 00:20:01,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (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-30 00:20:01,929 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-30 00:20:01,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-30 00:20:01,930 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-30 00:20:01,930 INFO L136 BoogieDeclarations]: Found implementation of procedure h_safe [2018-01-30 00:20:01,930 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-30 00:20:01,930 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-30 00:20:01,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-30 00:20:01,930 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-30 00:20:01,930 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-30 00:20:01,930 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-30 00:20:01,931 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-30 00:20:01,931 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-30 00:20:01,931 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-30 00:20:01,931 INFO L128 BoogieDeclarations]: Found specification of procedure h_safe [2018-01-30 00:20:01,931 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-30 00:20:01,931 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-30 00:20:01,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-30 00:20:01,932 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-30 00:20:02,088 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-30 00:20:02,088 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:02 BoogieIcfgContainer [2018-01-30 00:20:02,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-30 00:20:02,089 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-30 00:20:02,090 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-30 00:20:02,093 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-30 00:20:02,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.01 12:20:01" (1/3) ... [2018-01-30 00:20:02,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402c24f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:02, skipping insertion in model container [2018-01-30 00:20:02,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.01 12:20:01" (2/3) ... [2018-01-30 00:20:02,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@402c24f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.01 12:20:02, skipping insertion in model container [2018-01-30 00:20:02,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.01 12:20:02" (3/3) ... [2018-01-30 00:20:02,097 INFO L107 eAbstractionObserver]: Analyzing ICFG memleaks_test3_true-valid-memsafety_true-termination.i [2018-01-30 00:20:02,106 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-30 00:20:02,113 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-30 00:20:02,164 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-30 00:20:02,165 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-30 00:20:02,165 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-30 00:20:02,165 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-30 00:20:02,165 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-30 00:20:02,165 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-30 00:20:02,165 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-30 00:20:02,166 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-30 00:20:02,166 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-30 00:20:02,182 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-01-30 00:20:02,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:20:02,189 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:02,190 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:02,190 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:02,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1331177498, now seen corresponding path program 1 times [2018-01-30 00:20:02,195 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:02,196 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:02,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,247 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:02,247 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:02,301 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:02,491 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-30 00:20:02,494 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:02,495 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:02,497 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:20:02,508 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:20:02,508 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:02,511 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 7 states. [2018-01-30 00:20:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:02,696 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2018-01-30 00:20:02,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:20:02,701 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-30 00:20:02,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:02,715 INFO L225 Difference]: With dead ends: 48 [2018-01-30 00:20:02,715 INFO L226 Difference]: Without dead ends: 44 [2018-01-30 00:20:02,719 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:20:02,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-30 00:20:02,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-01-30 00:20:02,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 00:20:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-30 00:20:02,755 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 24 [2018-01-30 00:20:02,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:02,755 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-30 00:20:02,756 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:20:02,756 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-30 00:20:02,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-30 00:20:02,757 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:02,757 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:02,758 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:02,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1331177497, now seen corresponding path program 1 times [2018-01-30 00:20:02,758 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:02,758 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:02,760 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,760 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:02,761 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:02,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:02,879 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-30 00:20:02,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:02,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-30 00:20:02,881 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:20:02,881 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:20:02,883 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:02,883 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 7 states. [2018-01-30 00:20:02,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:02,940 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2018-01-30 00:20:02,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:20:02,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-30 00:20:02,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:02,944 INFO L225 Difference]: With dead ends: 46 [2018-01-30 00:20:02,944 INFO L226 Difference]: Without dead ends: 45 [2018-01-30 00:20:02,945 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:20:02,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-30 00:20:02,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-01-30 00:20:02,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-30 00:20:02,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2018-01-30 00:20:02,952 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 24 [2018-01-30 00:20:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:02,953 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2018-01-30 00:20:02,953 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:20:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2018-01-30 00:20:02,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:20:02,954 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:02,954 INFO L350 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-30 00:20:02,954 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:02,955 INFO L82 PathProgramCache]: Analyzing trace with hash -839121345, now seen corresponding path program 1 times [2018-01-30 00:20:02,955 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:02,955 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:02,956 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,957 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:02,957 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:02,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:03,073 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-30 00:20:03,074 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:03,074 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:03,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:20:03,075 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:20:03,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:03,075 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand 8 states. [2018-01-30 00:20:03,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:03,156 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-01-30 00:20:03,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-30 00:20:03,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-30 00:20:03,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:03,158 INFO L225 Difference]: With dead ends: 43 [2018-01-30 00:20:03,158 INFO L226 Difference]: Without dead ends: 42 [2018-01-30 00:20:03,159 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:20:03,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-30 00:20:03,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-30 00:20:03,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-30 00:20:03,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2018-01-30 00:20:03,166 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 25 [2018-01-30 00:20:03,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:03,166 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2018-01-30 00:20:03,166 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:20:03,166 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2018-01-30 00:20:03,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-30 00:20:03,167 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:03,168 INFO L350 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-30 00:20:03,168 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:03,168 INFO L82 PathProgramCache]: Analyzing trace with hash -839121344, now seen corresponding path program 1 times [2018-01-30 00:20:03,168 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:03,168 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:03,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,170 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:03,170 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:03,186 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:03,323 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-30 00:20:03,323 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:03,323 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:03,323 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:20:03,324 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:20:03,324 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:03,324 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 8 states. [2018-01-30 00:20:03,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:03,480 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-01-30 00:20:03,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:20:03,481 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-01-30 00:20:03,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:03,482 INFO L225 Difference]: With dead ends: 44 [2018-01-30 00:20:03,482 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 00:20:03,482 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:20:03,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 00:20:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-01-30 00:20:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-30 00:20:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-01-30 00:20:03,486 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 25 [2018-01-30 00:20:03,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:03,486 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-01-30 00:20:03,487 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:20:03,487 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-01-30 00:20:03,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-30 00:20:03,487 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:03,487 INFO L350 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-30 00:20:03,488 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:03,488 INFO L82 PathProgramCache]: Analyzing trace with hash 638833743, now seen corresponding path program 1 times [2018-01-30 00:20:03,488 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:03,488 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:03,489 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,489 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:03,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:03,502 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:03,543 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-30 00:20:03,543 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:03,544 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-30 00:20:03,544 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-30 00:20:03,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-30 00:20:03,544 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:03,544 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 3 states. [2018-01-30 00:20:03,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:03,605 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-01-30 00:20:03,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-30 00:20:03,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-01-30 00:20:03,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:03,607 INFO L225 Difference]: With dead ends: 45 [2018-01-30 00:20:03,608 INFO L226 Difference]: Without dead ends: 41 [2018-01-30 00:20:03,608 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-30 00:20:03,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-30 00:20:03,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-01-30 00:20:03,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-30 00:20:03,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-01-30 00:20:03,616 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 26 [2018-01-30 00:20:03,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:03,616 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-01-30 00:20:03,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-30 00:20:03,617 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-01-30 00:20:03,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:20:03,618 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:03,618 INFO L350 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-30 00:20:03,618 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:03,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1058394216, now seen corresponding path program 1 times [2018-01-30 00:20:03,619 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:03,619 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:03,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,621 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:03,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:03,635 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:03,728 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-30 00:20:03,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:03,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:20:03,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-30 00:20:03,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-30 00:20:03,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-30 00:20:03,730 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 8 states. [2018-01-30 00:20:03,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:03,809 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-01-30 00:20:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-30 00:20:03,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-01-30 00:20:03,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:03,811 INFO L225 Difference]: With dead ends: 47 [2018-01-30 00:20:03,811 INFO L226 Difference]: Without dead ends: 43 [2018-01-30 00:20:03,811 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-30 00:20:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-30 00:20:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2018-01-30 00:20:03,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-01-30 00:20:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-01-30 00:20:03,816 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 27 [2018-01-30 00:20:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:03,817 INFO L432 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-01-30 00:20:03,817 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-30 00:20:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-01-30 00:20:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-30 00:20:03,818 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:03,819 INFO L350 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-30 00:20:03,819 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1675791831, now seen corresponding path program 1 times [2018-01-30 00:20:03,820 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:03,820 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:03,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,821 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:03,821 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:03,829 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:03,889 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-30 00:20:03,889 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:03,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-30 00:20:03,889 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-30 00:20:03,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-30 00:20:03,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-30 00:20:03,890 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 7 states. [2018-01-30 00:20:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:03,953 INFO L93 Difference]: Finished difference Result 45 states and 44 transitions. [2018-01-30 00:20:03,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-30 00:20:03,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-01-30 00:20:03,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:03,954 INFO L225 Difference]: With dead ends: 45 [2018-01-30 00:20:03,955 INFO L226 Difference]: Without dead ends: 29 [2018-01-30 00:20:03,955 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:20:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-30 00:20:03,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-30 00:20:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-30 00:20:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2018-01-30 00:20:03,959 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 27 [2018-01-30 00:20:03,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:03,959 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2018-01-30 00:20:03,959 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-30 00:20:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2018-01-30 00:20:03,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-30 00:20:03,960 INFO L342 BasicCegarLoop]: Found error trace [2018-01-30 00:20:03,961 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-30 00:20:03,961 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, entry_pointErr0RequiresViolation, entry_pointErr1RequiresViolation]=== [2018-01-30 00:20:03,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1554319056, now seen corresponding path program 1 times [2018-01-30 00:20:03,961 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-30 00:20:03,961 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-30 00:20:03,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-30 00:20:03,963 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-30 00:20:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-30 00:20:03,978 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-30 00:20:04,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-30 00:20:04,290 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-30 00:20:04,291 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-30 00:20:04,291 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-30 00:20:04,291 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-30 00:20:04,291 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-01-30 00:20:04,291 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 9 states. [2018-01-30 00:20:04,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-30 00:20:04,529 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2018-01-30 00:20:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-30 00:20:04,530 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-01-30 00:20:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-30 00:20:04,530 INFO L225 Difference]: With dead ends: 29 [2018-01-30 00:20:04,530 INFO L226 Difference]: Without dead ends: 0 [2018-01-30 00:20:04,531 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-01-30 00:20:04,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-30 00:20:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-30 00:20:04,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-30 00:20:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-30 00:20:04,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-30 00:20:04,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-30 00:20:04,532 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-30 00:20:04,532 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-30 00:20:04,532 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-30 00:20:04,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-30 00:20:04,537 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-30 00:20:04,556 INFO L395 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:20:04,556 INFO L399 ceAbstractionStarter]: For program point L1073(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:04,556 INFO L399 ceAbstractionStarter]: For program point L1073''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:04,556 INFO L399 ceAbstractionStarter]: For program point L1073'''(line 1073) no Hoare annotation was computed. [2018-01-30 00:20:04,556 INFO L399 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:04,556 INFO L399 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:04,556 INFO L399 ceAbstractionStarter]: For program point L1073'(lines 1073 1077) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point L1076(line 1076) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1444) the Hoare annotation is: true [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 1444) the Hoare annotation is: true [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,557 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 1442 1444) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:20:04,557 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 1442 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 1442 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1442 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L395 ceAbstractionStarter]: At program point h_safeENTRY(lines 1433 1435) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point L1434(line 1434) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point h_safeFINAL(lines 1433 1435) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point L1434'(line 1434) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point h_safeEXIT(lines 1433 1435) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point entry_pointErr1RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point L1438'(line 1438) no Hoare annotation was computed. [2018-01-30 00:20:04,558 INFO L399 ceAbstractionStarter]: For program point L1439'(line 1439) no Hoare annotation was computed. [2018-01-30 00:20:04,559 INFO L399 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1437 1440) no Hoare annotation was computed. [2018-01-30 00:20:04,559 INFO L399 ceAbstractionStarter]: For program point L1438(line 1438) no Hoare annotation was computed. [2018-01-30 00:20:04,559 INFO L399 ceAbstractionStarter]: For program point L1439(line 1439) no Hoare annotation was computed. [2018-01-30 00:20:04,559 INFO L395 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1437 1440) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-30 00:20:04,559 INFO L399 ceAbstractionStarter]: For program point entry_pointErr0RequiresViolation(lines 1 1444) no Hoare annotation was computed. [2018-01-30 00:20:04,559 INFO L399 ceAbstractionStarter]: For program point L1439'''(line 1439) no Hoare annotation was computed. [2018-01-30 00:20:04,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.01 12:20:04 BoogieIcfgContainer [2018-01-30 00:20:04,563 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-30 00:20:04,564 INFO L168 Benchmark]: Toolchain (without parser) took 2989.49 ms. Allocated memory was 308.8 MB in the beginning and 452.5 MB in the end (delta: 143.7 MB). Free memory was 265.5 MB in the beginning and 337.1 MB in the end (delta: -71.6 MB). Peak memory consumption was 72.1 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:04,565 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 308.8 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:20:04,565 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.18 ms. Allocated memory is still 308.8 MB. Free memory was 265.5 MB in the beginning and 251.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:04,565 INFO L168 Benchmark]: Boogie Preprocessor took 33.69 ms. Allocated memory is still 308.8 MB. Free memory is still 251.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-30 00:20:04,566 INFO L168 Benchmark]: RCFGBuilder took 207.43 ms. Allocated memory is still 308.8 MB. Free memory was 251.6 MB in the beginning and 236.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:04,566 INFO L168 Benchmark]: TraceAbstraction took 2473.65 ms. Allocated memory was 308.8 MB in the beginning and 452.5 MB in the end (delta: 143.7 MB). Free memory was 236.6 MB in the beginning and 337.1 MB in the end (delta: -100.5 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. [2018-01-30 00:20:04,568 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.21 ms. Allocated memory is still 308.8 MB. Free memory is still 271.5 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 265.18 ms. Allocated memory is still 308.8 MB. Free memory was 265.5 MB in the beginning and 251.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 33.69 ms. Allocated memory is still 308.8 MB. Free memory is still 251.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 207.43 ms. Allocated memory is still 308.8 MB. Free memory was 251.6 MB in the beginning and 236.6 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2473.65 ms. Allocated memory was 308.8 MB in the beginning and 452.5 MB in the end (delta: 143.7 MB). Free memory was 236.6 MB in the beginning and 337.1 MB in the end (delta: -100.5 MB). Peak memory consumption was 43.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1442]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 3 error locations. SAFE Result, 2.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 239 SDtfs, 44 SDslu, 1057 SDs, 0 SdLazy, 351 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=1, 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, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 17 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 198 ConstructedInterpolants, 0 QuantifiedInterpolants, 17138 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-30_00-20-04-576.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test3_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-30_00-20-04-576.csv Received shutdown request...