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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:34:32,074 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:34:32,076 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:34:32,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:34:32,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:34:32,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:34:32,092 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:34:32,093 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:34:32,094 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:34:32,095 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:34:32,096 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:34:32,096 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:34:32,097 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:34:32,098 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:34:32,099 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:34:32,102 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:34:32,104 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:34:32,106 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:34:32,107 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:34:32,109 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:34:32,111 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:34:32,111 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:34:32,111 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:34:32,113 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:34:32,113 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:34:32,115 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:34:32,115 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:34:32,116 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:34:32,116 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:34:32,116 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:34:32,117 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:34:32,164 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:34:32,171 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:34:32,171 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:34:32,172 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:34:32,172 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:34:32,172 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:34:32,173 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:34:32,173 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:34:32,173 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:34:32,174 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:34:32,174 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:34:32,174 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:34:32,174 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:34:32,174 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:34:32,174 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:34:32,175 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:34:32,175 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:34:32,175 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:34:32,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:34:32,175 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:34:32,175 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:34:32,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:34:32,176 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:34:32,176 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:34:32,176 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:34:32,176 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:34:32,177 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:34:32,177 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:34:32,177 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:34:32,177 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:34:32,177 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:34:32,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:34:32,178 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:34:32,178 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:34:32,179 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:34:32,213 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:34:32,224 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:34:32,228 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:34:32,229 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:34:32,230 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:34:32,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-24 13:34:32,437 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:34:32,444 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:34:32,445 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:34:32,445 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:34:32,451 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:34:32,452 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,455 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4be9a57f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32, skipping insertion in model container [2018-01-24 13:34:32,455 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,474 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:34:32,524 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:34:32,636 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:34:32,649 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:34:32,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32 WrapperNode [2018-01-24 13:34:32,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:34:32,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:34:32,657 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:34:32,657 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:34:32,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,688 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,689 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (1/1) ... [2018-01-24 13:34:32,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:34:32,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:34:32,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:34:32,692 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:34:32,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (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-24 13:34:32,739 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:34:32,739 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:34:32,739 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 13:34:32,739 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9 [2018-01-24 13:34:32,740 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-01-24 13:34:32,740 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 13:34:32,740 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:34:32,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:34:32,740 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:34:32,740 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:34:32,740 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 13:34:32,740 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 13:34:32,740 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 13:34:32,741 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 13:34:32,741 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9 [2018-01-24 13:34:32,741 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-01-24 13:34:32,741 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 13:34:32,741 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:34:32,741 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:34:32,741 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:34:32,892 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:34:32,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:34:32 BoogieIcfgContainer [2018-01-24 13:34:32,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:34:32,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:34:32,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:34:32,896 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:34:32,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:34:32" (1/3) ... [2018-01-24 13:34:32,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1b672a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:34:32, skipping insertion in model container [2018-01-24 13:34:32,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:34:32" (2/3) ... [2018-01-24 13:34:32,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b1b672a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:34:32, skipping insertion in model container [2018-01-24 13:34:32,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:34:32" (3/3) ... [2018-01-24 13:34:32,899 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-24 13:34:32,905 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:34:32,911 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 13:34:32,948 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:34:32,948 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:34:32,948 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:34:32,948 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:34:32,949 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:34:32,949 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:34:32,949 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:34:32,949 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:34:32,950 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:34:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-01-24 13:34:32,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 13:34:32,977 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:32,978 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-24 13:34:32,978 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:32,983 INFO L82 PathProgramCache]: Analyzing trace with hash 637985235, now seen corresponding path program 1 times [2018-01-24 13:34:32,986 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:33,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:33,038 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:33,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:33,038 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:33,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:33,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:33,275 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-24 13:34:33,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:33,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:34:33,278 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:33,281 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:34:33,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:34:33,293 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:34:33,295 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-01-24 13:34:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:33,459 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-24 13:34:33,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:34:33,461 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-24 13:34:33,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:33,472 INFO L225 Difference]: With dead ends: 65 [2018-01-24 13:34:33,473 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 13:34:33,477 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:33,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 13:34:33,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-01-24 13:34:33,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-24 13:34:33,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-24 13:34:33,516 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-01-24 13:34:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:33,517 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-24 13:34:33,517 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:34:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-24 13:34:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:34:33,518 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:33,518 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:33,519 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317329, now seen corresponding path program 1 times [2018-01-24 13:34:33,519 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:33,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:33,521 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:33,521 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:33,521 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:33,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:33,552 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:33,618 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-24 13:34:33,618 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:33,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:34:33,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:33,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:34:33,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:34:33,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:34:33,622 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-24 13:34:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:33,711 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-24 13:34:33,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:34:33,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 13:34:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:33,716 INFO L225 Difference]: With dead ends: 43 [2018-01-24 13:34:33,716 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 13:34:33,717 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-24 13:34:33,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 13:34:33,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-24 13:34:33,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-24 13:34:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-24 13:34:33,724 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2018-01-24 13:34:33,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:33,725 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-24 13:34:33,725 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:34:33,725 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-24 13:34:33,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:34:33,726 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:33,726 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:33,727 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:33,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317330, now seen corresponding path program 1 times [2018-01-24 13:34:33,727 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:33,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:33,729 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:33,729 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:33,729 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:33,749 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:33,856 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-24 13:34:33,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:33,936 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:34:33,936 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:33,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:34:33,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:34:33,937 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:34:33,937 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2018-01-24 13:34:34,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:34,020 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-24 13:34:34,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:34:34,021 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-24 13:34:34,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:34,022 INFO L225 Difference]: With dead ends: 49 [2018-01-24 13:34:34,022 INFO L226 Difference]: Without dead ends: 48 [2018-01-24 13:34:34,023 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:34,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-24 13:34:34,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2018-01-24 13:34:34,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-24 13:34:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-24 13:34:34,036 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-01-24 13:34:34,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:34,037 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-24 13:34:34,037 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:34:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-24 13:34:34,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-24 13:34:34,038 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:34,038 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:34,038 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:34,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1413293605, now seen corresponding path program 1 times [2018-01-24 13:34:34,039 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:34,040 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,040 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:34,041 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,041 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:34,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:34,055 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:34,089 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-24 13:34:34,090 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:34,090 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:34:34,090 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:34,090 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:34:34,091 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:34:34,091 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:34:34,091 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-01-24 13:34:34,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:34,133 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-24 13:34:34,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:34:34,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-24 13:34:34,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:34,134 INFO L225 Difference]: With dead ends: 43 [2018-01-24 13:34:34,134 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 13:34:34,134 INFO L525 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-24 13:34:34,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 13:34:34,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 13:34:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 13:34:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 13:34:34,141 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2018-01-24 13:34:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:34,141 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 13:34:34,141 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:34:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 13:34:34,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:34:34,142 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:34,142 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:34,142 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:34,142 INFO L82 PathProgramCache]: Analyzing trace with hash -431737374, now seen corresponding path program 1 times [2018-01-24 13:34:34,142 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:34,143 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:34,144 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,144 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:34,157 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:34,191 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-24 13:34:34,191 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:34,191 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:34:34,191 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:34,192 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:34:34,192 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:34:34,192 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:34:34,192 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2018-01-24 13:34:34,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:34,208 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-24 13:34:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:34:34,209 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-24 13:34:34,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:34,209 INFO L225 Difference]: With dead ends: 49 [2018-01-24 13:34:34,209 INFO L226 Difference]: Without dead ends: 44 [2018-01-24 13:34:34,210 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:34:34,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-24 13:34:34,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-01-24 13:34:34,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 13:34:34,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-24 13:34:34,215 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-01-24 13:34:34,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:34,215 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-24 13:34:34,215 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:34:34,215 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-24 13:34:34,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 13:34:34,216 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:34,216 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:34,216 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:34,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2055775459, now seen corresponding path program 1 times [2018-01-24 13:34:34,216 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:34,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,217 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:34,217 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,217 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:34,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:34,232 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:34,284 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-24 13:34:34,284 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:34,284 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:34:34,284 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:34,285 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:34:34,285 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:34:34,285 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:34:34,286 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2018-01-24 13:34:34,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:34,330 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-01-24 13:34:34,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:34:34,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 13:34:34,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:34,331 INFO L225 Difference]: With dead ends: 55 [2018-01-24 13:34:34,331 INFO L226 Difference]: Without dead ends: 42 [2018-01-24 13:34:34,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-24 13:34:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-01-24 13:34:34,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-24 13:34:34,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-01-24 13:34:34,339 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 24 [2018-01-24 13:34:34,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:34,340 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-01-24 13:34:34,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:34:34,340 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-01-24 13:34:34,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 13:34:34,341 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:34,341 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-24 13:34:34,341 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:34,342 INFO L82 PathProgramCache]: Analyzing trace with hash -119628224, now seen corresponding path program 1 times [2018-01-24 13:34:34,342 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:34,343 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,343 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:34,344 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,344 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:34,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:34,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:34,430 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-24 13:34:34,430 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:34,430 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 13:34:34,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:34,431 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 13:34:34,431 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 13:34:34,431 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:34,432 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 7 states. [2018-01-24 13:34:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:34,527 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-01-24 13:34:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:34:34,528 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-24 13:34:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:34,529 INFO L225 Difference]: With dead ends: 46 [2018-01-24 13:34:34,529 INFO L226 Difference]: Without dead ends: 29 [2018-01-24 13:34:34,530 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:34:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-24 13:34:34,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-24 13:34:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-24 13:34:34,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2018-01-24 13:34:34,536 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 26 [2018-01-24 13:34:34,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:34,536 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2018-01-24 13:34:34,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 13:34:34,536 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2018-01-24 13:34:34,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:34:34,537 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:34:34,537 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:34:34,538 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-24 13:34:34,538 INFO L82 PathProgramCache]: Analyzing trace with hash 221087613, now seen corresponding path program 1 times [2018-01-24 13:34:34,538 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:34:34,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,539 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:34:34,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:34:34,539 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:34:34,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:34:34,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:34:34,782 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-24 13:34:34,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:34:34,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 13:34:34,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:34:34,783 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 13:34:34,783 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 13:34:34,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 13:34:34,784 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 8 states. [2018-01-24 13:34:34,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:34:34,979 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2018-01-24 13:34:34,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 13:34:34,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-24 13:34:34,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:34:34,980 INFO L225 Difference]: With dead ends: 29 [2018-01-24 13:34:34,980 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 13:34:34,981 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-24 13:34:34,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 13:34:34,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 13:34:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 13:34:34,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 13:34:34,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-24 13:34:34,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:34:34,982 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 13:34:34,982 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 13:34:34,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 13:34:34,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 13:34:34,986 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 13:34:35,018 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 13:34:35,225 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 32 DAG size of output 18 [2018-01-24 13:34:35,312 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= ~a9.offset 0)) (not (= 0 ~a9.base)) (= |#valid| |old(#valid)|)) [2018-01-24 13:34:35,312 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-24 13:34:35,312 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-24 13:34:35,312 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 13:34:35,312 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 13:34:35,313 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-24 13:34:35,313 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,313 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1458) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:34:35,313 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,313 INFO L401 ceAbstractionStarter]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2018-01-24 13:34:35,313 INFO L401 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-24 13:34:35,313 INFO L397 ceAbstractionStarter]: At program point probe_9ENTRY(lines 1436 1442) the Hoare annotation is: (or (not (= |old(~a9.offset)| 0)) (not (= 0 |old(~a9.base)|)) (and (= |#valid| |old(#valid)|) (= ~a9.base 0) (= ~a9.offset 0))) [2018-01-24 13:34:35,313 INFO L401 ceAbstractionStarter]: For program point probe_9FINAL(lines 1436 1442) no Hoare annotation was computed. [2018-01-24 13:34:35,314 INFO L401 ceAbstractionStarter]: For program point probe_9EXIT(lines 1436 1442) no Hoare annotation was computed. [2018-01-24 13:34:35,314 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1458) the Hoare annotation is: true [2018-01-24 13:34:35,314 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,314 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1458) the Hoare annotation is: (and (= ~a9.base 0) (= ~a9.offset 0)) [2018-01-24 13:34:35,314 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,314 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1456 1458) the Hoare annotation is: (or (not (= |old(~a9.offset)| 0)) (not (= 0 |old(~a9.base)|)) (and (= |#valid| |old(#valid)|) (= ~a9.base 0) (= ~a9.offset 0))) [2018-01-24 13:34:35,314 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1456 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,314 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1456 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,315 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1456 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,315 INFO L401 ceAbstractionStarter]: For program point L1449(line 1449) no Hoare annotation was computed. [2018-01-24 13:34:35,315 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1448 1454) the Hoare annotation is: (or (not (= |old(~a9.offset)| 0)) (not (= 0 |old(~a9.base)|)) (and (= |#valid| |old(#valid)|) (= ~a9.base 0) (= ~a9.offset 0))) [2018-01-24 13:34:35,315 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1448 1454) no Hoare annotation was computed. [2018-01-24 13:34:35,315 INFO L401 ceAbstractionStarter]: For program point L1450'(lines 1450 1452) no Hoare annotation was computed. [2018-01-24 13:34:35,315 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1448 1454) no Hoare annotation was computed. [2018-01-24 13:34:35,315 INFO L401 ceAbstractionStarter]: For program point L1450(lines 1450 1452) no Hoare annotation was computed. [2018-01-24 13:34:35,315 INFO L397 ceAbstractionStarter]: At program point L1451(line 1451) the Hoare annotation is: (let ((.cse2 (= ~a9.base 0))) (let ((.cse0 (and (= entry_point_~ret~9 0) (let ((.cse3 (= ~a9.offset 0))) (or (and (= 1 (select |#valid| ~a9.base)) .cse3) (and .cse2 .cse3)))))) (or (not (= |old(~a9.offset)| 0)) (let ((.cse1 (select |old(#valid)| ~a9.base))) (and (not (= 0 ~a9.base)) .cse0 (= |old(#valid)| (store |#valid| ~a9.base .cse1)) (= 0 .cse1))) (not (= 0 |old(~a9.base)|)) (and .cse0 (= |#valid| |old(#valid)|) .cse2)))) [2018-01-24 13:34:35,315 INFO L397 ceAbstractionStarter]: At program point disconnect_9ENTRY(lines 1444 1446) the Hoare annotation is: (or (let ((.cse0 (not (= ~a9.offset 0)))) (and (or .cse0 (not (= 0 ~a9.base))) (or .cse0 (not (= 1 (select |old(#valid)| ~a9.base)))))) (= |#valid| |old(#valid)|)) [2018-01-24 13:34:35,315 INFO L401 ceAbstractionStarter]: For program point disconnect_9EXIT(lines 1444 1446) no Hoare annotation was computed. [2018-01-24 13:34:35,316 INFO L401 ceAbstractionStarter]: For program point disconnect_9FINAL(lines 1444 1446) no Hoare annotation was computed. [2018-01-24 13:34:35,316 INFO L401 ceAbstractionStarter]: For program point disconnect_9Err0RequiresViolation(lines 1 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,316 INFO L401 ceAbstractionStarter]: For program point disconnect_9Err1RequiresViolation(lines 1 1458) no Hoare annotation was computed. [2018-01-24 13:34:35,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:34:35 BoogieIcfgContainer [2018-01-24 13:34:35,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:34:35,319 INFO L168 Benchmark]: Toolchain (without parser) took 2881.36 ms. Allocated memory was 304.1 MB in the beginning and 473.4 MB in the end (delta: 169.3 MB). Free memory was 263.1 MB in the beginning and 378.3 MB in the end (delta: -115.2 MB). Peak memory consumption was 54.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:35,320 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:34:35,321 INFO L168 Benchmark]: CACSL2BoogieTranslator took 210.86 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 250.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:35,321 INFO L168 Benchmark]: Boogie Preprocessor took 34.79 ms. Allocated memory is still 304.1 MB. Free memory was 250.0 MB in the beginning and 249.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. [2018-01-24 13:34:35,321 INFO L168 Benchmark]: RCFGBuilder took 201.69 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 235.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:35,321 INFO L168 Benchmark]: TraceAbstraction took 2424.96 ms. Allocated memory was 304.1 MB in the beginning and 473.4 MB in the end (delta: 169.3 MB). Free memory was 235.2 MB in the beginning and 378.3 MB in the end (delta: -143.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. [2018-01-24 13:34:35,323 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.20 ms. Allocated memory is still 304.1 MB. Free memory is still 270.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 210.86 ms. Allocated memory is still 304.1 MB. Free memory was 263.1 MB in the beginning and 250.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.79 ms. Allocated memory is still 304.1 MB. Free memory was 250.0 MB in the beginning and 249.0 MB in the end (delta: 996.4 kB). Peak memory consumption was 996.4 kB. Max. memory is 5.3 GB. * RCFGBuilder took 201.69 ms. Allocated memory is still 304.1 MB. Free memory was 249.0 MB in the beginning and 235.2 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2424.96 ms. Allocated memory was 304.1 MB in the beginning and 473.4 MB in the end (delta: 169.3 MB). Free memory was 235.2 MB in the beginning and 378.3 MB in the end (delta: -143.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1456]: 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 7 procedures, 34 locations, 3 error locations. SAFE Result, 2.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 87 SDslu, 604 SDs, 0 SdLazy, 283 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.5s 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, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 33 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 14 NumberOfFragments, 181 HoareAnnotationTreeSize, 12 FomulaSimplifications, 275 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 249 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 15483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: 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_test9_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-34-35-330.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test9_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-34-35-330.csv Received shutdown request...