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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test9_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:38:44,451 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:38:44,453 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:38:44,470 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:38:44,470 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:38:44,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:38:44,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:38:44,474 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:38:44,476 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:38:44,477 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:38:44,478 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:38:44,479 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:38:44,479 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:38:44,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:38:44,481 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:38:44,484 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:38:44,487 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:38:44,489 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:38:44,491 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:38:44,492 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:38:44,495 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:38:44,495 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:38:44,495 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:38:44,497 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:38:44,531 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:38:44,532 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:38:44,532 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:38:44,533 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:38:44,533 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:38:44,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:38:44,534 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:38:44,534 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:38:44,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:38:44,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:38:44,546 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:38:44,546 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:38:44,546 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:38:44,547 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:38:44,547 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:38:44,547 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:38:44,547 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:38:44,556 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:38:44,556 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:38:44,557 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:38:44,557 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:38:44,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:38:44,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:38:44,557 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:38:44,558 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:38:44,558 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:38:44,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:38:44,558 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:38:44,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:38:44,559 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:38:44,559 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:38:44,559 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:38:44,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:38:44,559 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:38:44,560 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:38:44,560 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:38:44,561 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:38:44,561 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:38:44,561 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:38:44,561 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:38:44,561 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:38:44,562 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:38:44,562 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:38:44,563 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:38:44,563 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:38:44,607 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:38:44,619 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:38:44,622 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:38:44,624 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:38:44,624 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:38:44,625 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-25 03:38:44,827 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:38:44,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:38:44,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:44,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:38:44,842 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:38:44,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:44" (1/1) ... [2018-01-25 03:38:44,846 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:44, skipping insertion in model container [2018-01-25 03:38:44,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:38:44" (1/1) ... [2018-01-25 03:38:44,869 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:44,921 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:38:45,053 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:45,070 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:38:45,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45 WrapperNode [2018-01-25 03:38:45,078 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:38:45,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:38:45,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:38:45,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:38:45,106 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... [2018-01-25 03:38:45,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... [2018-01-25 03:38:45,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... [2018-01-25 03:38:45,119 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... [2018-01-25 03:38:45,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... [2018-01-25 03:38:45,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... [2018-01-25 03:38:45,127 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... [2018-01-25 03:38:45,129 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:38:45,129 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:38:45,130 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:38:45,130 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:38:45,136 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:38:45,194 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:38:45,194 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:38:45,194 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-25 03:38:45,194 INFO L136 BoogieDeclarations]: Found implementation of procedure probe_9 [2018-01-25 03:38:45,194 INFO L136 BoogieDeclarations]: Found implementation of procedure disconnect_9 [2018-01-25 03:38:45,195 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-25 03:38:45,195 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:38:45,195 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:38:45,195 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:38:45,195 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:38:45,195 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:38:45,195 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:38:45,196 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:38:45,196 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-25 03:38:45,196 INFO L128 BoogieDeclarations]: Found specification of procedure probe_9 [2018-01-25 03:38:45,196 INFO L128 BoogieDeclarations]: Found specification of procedure disconnect_9 [2018-01-25 03:38:45,196 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-25 03:38:45,196 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:38:45,197 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:38:45,197 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:38:45,355 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:38:45,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:45 BoogieIcfgContainer [2018-01-25 03:38:45,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:38:45,356 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:38:45,356 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:38:45,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:38:45,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:38:44" (1/3) ... [2018-01-25 03:38:45,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5641e42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:45, skipping insertion in model container [2018-01-25 03:38:45,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:38:45" (2/3) ... [2018-01-25 03:38:45,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5641e42a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:38:45, skipping insertion in model container [2018-01-25 03:38:45,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:38:45" (3/3) ... [2018-01-25 03:38:45,362 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test9_true-valid-memsafety_true-termination.i [2018-01-25 03:38:45,369 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:38:45,375 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-25 03:38:45,440 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:38:45,441 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:38:45,441 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:38:45,441 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:38:45,441 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:38:45,441 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:38:45,441 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:38:45,442 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:38:45,442 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:38:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-01-25 03:38:45,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 03:38:45,478 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:45,479 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-25 03:38:45,479 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:45,485 INFO L82 PathProgramCache]: Analyzing trace with hash 637985235, now seen corresponding path program 1 times [2018-01-25 03:38:45,488 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:45,557 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:45,558 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:45,558 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:45,558 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:45,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:45,647 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:45,877 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-25 03:38:45,879 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:45,879 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:45,880 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:45,882 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:38:45,892 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:38:45,892 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:45,894 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 5 states. [2018-01-25 03:38:46,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:46,103 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-01-25 03:38:46,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:38:46,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 03:38:46,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:46,115 INFO L225 Difference]: With dead ends: 65 [2018-01-25 03:38:46,115 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:38:46,119 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-25 03:38:46,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:38:46,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-01-25 03:38:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 03:38:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2018-01-25 03:38:46,158 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 20 [2018-01-25 03:38:46,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:46,158 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2018-01-25 03:38:46,159 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:38:46,159 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2018-01-25 03:38:46,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:38:46,160 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:46,160 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-25 03:38:46,160 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:46,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317329, now seen corresponding path program 1 times [2018-01-25 03:38:46,161 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:46,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,165 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:46,165 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,165 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:46,217 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:46,292 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-25 03:38:46,292 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:46,292 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:46,293 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:46,294 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:46,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:46,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:46,295 INFO L87 Difference]: Start difference. First operand 43 states and 46 transitions. Second operand 6 states. [2018-01-25 03:38:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:46,386 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-25 03:38:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:38:46,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 03:38:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:46,391 INFO L225 Difference]: With dead ends: 43 [2018-01-25 03:38:46,391 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 03:38:46,392 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-25 03:38:46,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 03:38:46,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-01-25 03:38:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 03:38:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-01-25 03:38:46,405 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2018-01-25 03:38:46,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:46,405 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-01-25 03:38:46,405 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:46,405 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-01-25 03:38:46,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:38:46,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:46,406 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-25 03:38:46,407 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:46,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1778317330, now seen corresponding path program 1 times [2018-01-25 03:38:46,407 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:46,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,409 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:46,409 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,409 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:46,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:46,428 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:46,514 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-25 03:38:46,514 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:46,514 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:46,514 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:46,515 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:46,515 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:46,515 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:46,515 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 6 states. [2018-01-25 03:38:46,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:46,624 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2018-01-25 03:38:46,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:38:46,624 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-01-25 03:38:46,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:46,626 INFO L225 Difference]: With dead ends: 49 [2018-01-25 03:38:46,626 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 03:38:46,627 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-25 03:38:46,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 03:38:46,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 33. [2018-01-25 03:38:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-25 03:38:46,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-01-25 03:38:46,647 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-01-25 03:38:46,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:46,647 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-01-25 03:38:46,647 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:46,648 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-01-25 03:38:46,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:38:46,649 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:46,649 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-25 03:38:46,649 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:46,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1413293605, now seen corresponding path program 1 times [2018-01-25 03:38:46,649 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:46,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,651 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:46,651 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,651 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:46,675 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:46,716 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-25 03:38:46,716 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:46,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:38:46,717 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:46,717 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:38:46,717 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:38:46,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:38:46,718 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 3 states. [2018-01-25 03:38:46,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:46,793 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2018-01-25 03:38:46,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:38:46,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-01-25 03:38:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:46,795 INFO L225 Difference]: With dead ends: 43 [2018-01-25 03:38:46,795 INFO L226 Difference]: Without dead ends: 38 [2018-01-25 03:38:46,796 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-25 03:38:46,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-25 03:38:46,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-25 03:38:46,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 03:38:46,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 03:38:46,803 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 22 [2018-01-25 03:38:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:46,803 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 03:38:46,803 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:38:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 03:38:46,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:38:46,804 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:46,804 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-25 03:38:46,805 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:46,805 INFO L82 PathProgramCache]: Analyzing trace with hash -431737374, now seen corresponding path program 1 times [2018-01-25 03:38:46,805 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:46,806 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,806 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:46,807 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,807 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:46,826 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:46,859 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-25 03:38:46,859 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:46,860 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:38:46,860 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:46,860 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:38:46,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:38:46,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:38:46,861 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 5 states. [2018-01-25 03:38:46,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:46,887 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2018-01-25 03:38:46,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:38:46,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 03:38:46,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:46,889 INFO L225 Difference]: With dead ends: 49 [2018-01-25 03:38:46,889 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:38:46,889 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-25 03:38:46,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:38:46,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-01-25 03:38:46,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-25 03:38:46,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2018-01-25 03:38:46,897 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2018-01-25 03:38:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:46,897 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2018-01-25 03:38:46,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:38:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2018-01-25 03:38:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:38:46,898 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:46,898 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-25 03:38:46,899 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:46,899 INFO L82 PathProgramCache]: Analyzing trace with hash 2055775459, now seen corresponding path program 1 times [2018-01-25 03:38:46,899 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:46,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,900 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:46,900 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:46,900 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:46,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:46,970 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-25 03:38:46,970 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:46,970 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:38:46,971 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:46,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:38:46,971 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:38:46,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:38:46,972 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 6 states. [2018-01-25 03:38:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:47,057 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-01-25 03:38:47,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:38:47,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-25 03:38:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:47,059 INFO L225 Difference]: With dead ends: 55 [2018-01-25 03:38:47,059 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 03:38:47,059 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-25 03:38:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 03:38:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2018-01-25 03:38:47,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-25 03:38:47,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-01-25 03:38:47,066 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 24 [2018-01-25 03:38:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:47,067 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-01-25 03:38:47,067 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:38:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-01-25 03:38:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 03:38:47,068 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:47,068 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-25 03:38:47,068 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash -119628224, now seen corresponding path program 1 times [2018-01-25 03:38:47,069 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:47,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:47,070 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:47,070 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:47,071 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:47,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:47,083 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:47,172 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-25 03:38:47,172 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:47,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:38:47,173 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:47,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:38:47,174 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:38:47,174 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:38:47,174 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 7 states. [2018-01-25 03:38:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:47,388 INFO L93 Difference]: Finished difference Result 46 states and 45 transitions. [2018-01-25 03:38:47,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:38:47,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-01-25 03:38:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:47,389 INFO L225 Difference]: With dead ends: 46 [2018-01-25 03:38:47,389 INFO L226 Difference]: Without dead ends: 29 [2018-01-25 03:38:47,390 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-25 03:38:47,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-01-25 03:38:47,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-01-25 03:38:47,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-01-25 03:38:47,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 28 transitions. [2018-01-25 03:38:47,401 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 28 transitions. Word has length 26 [2018-01-25 03:38:47,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:47,401 INFO L432 AbstractCegarLoop]: Abstraction has 29 states and 28 transitions. [2018-01-25 03:38:47,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:38:47,402 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 28 transitions. [2018-01-25 03:38:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:38:47,402 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:38:47,402 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-25 03:38:47,402 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr0EnsuresViolation, disconnect_9Err1RequiresViolation, disconnect_9Err0RequiresViolation]=== [2018-01-25 03:38:47,403 INFO L82 PathProgramCache]: Analyzing trace with hash 221087613, now seen corresponding path program 1 times [2018-01-25 03:38:47,403 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:38:47,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:47,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:38:47,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:38:47,404 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:38:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:38:47,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:38:47,871 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-25 03:38:47,871 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:38:47,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:38:47,872 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:38:47,872 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:38:47,872 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:38:47,872 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:38:47,873 INFO L87 Difference]: Start difference. First operand 29 states and 28 transitions. Second operand 8 states. [2018-01-25 03:38:48,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:38:48,084 INFO L93 Difference]: Finished difference Result 29 states and 28 transitions. [2018-01-25 03:38:48,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-25 03:38:48,084 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2018-01-25 03:38:48,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:38:48,085 INFO L225 Difference]: With dead ends: 29 [2018-01-25 03:38:48,085 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 03:38:48,085 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:38:48,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 03:38:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 03:38:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 03:38:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 03:38:48,086 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2018-01-25 03:38:48,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:38:48,086 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 03:38:48,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:38:48,086 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 03:38:48,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 03:38:48,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 03:38:48,128 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-25 03:38:48,298 WARN L146 SmtUtils]: Spent 140ms on a formula simplification. DAG size of input: 13 DAG size of output 11 [2018-01-25 03:38:48,530 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 32 DAG size of output 18 [2018-01-25 03:38:48,622 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-25 03:38:48,623 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-25 03:38:48,623 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-25 03:38:48,623 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:38:48,623 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-25 03:38:48,623 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-25 03:38:48,623 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,623 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1458) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 03:38:48,623 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,624 INFO L401 ceAbstractionStarter]: For program point L1438(lines 1438 1441) no Hoare annotation was computed. [2018-01-25 03:38:48,624 INFO L401 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-25 03:38:48,624 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-25 03:38:48,624 INFO L401 ceAbstractionStarter]: For program point probe_9FINAL(lines 1436 1442) no Hoare annotation was computed. [2018-01-25 03:38:48,624 INFO L401 ceAbstractionStarter]: For program point probe_9EXIT(lines 1436 1442) no Hoare annotation was computed. [2018-01-25 03:38:48,624 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1458) the Hoare annotation is: true [2018-01-25 03:38:48,624 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,624 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1458) the Hoare annotation is: (and (= ~a9.base 0) (= ~a9.offset 0)) [2018-01-25 03:38:48,625 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,625 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-25 03:38:48,625 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1456 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,625 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1456 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,625 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1456 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,625 INFO L401 ceAbstractionStarter]: For program point L1449(line 1449) no Hoare annotation was computed. [2018-01-25 03:38:48,625 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-25 03:38:48,626 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1448 1454) no Hoare annotation was computed. [2018-01-25 03:38:48,626 INFO L401 ceAbstractionStarter]: For program point L1450'(lines 1450 1452) no Hoare annotation was computed. [2018-01-25 03:38:48,626 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1448 1454) no Hoare annotation was computed. [2018-01-25 03:38:48,626 INFO L401 ceAbstractionStarter]: For program point L1450(lines 1450 1452) no Hoare annotation was computed. [2018-01-25 03:38:48,628 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-25 03:38:48,628 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-25 03:38:48,628 INFO L401 ceAbstractionStarter]: For program point disconnect_9EXIT(lines 1444 1446) no Hoare annotation was computed. [2018-01-25 03:38:48,628 INFO L401 ceAbstractionStarter]: For program point disconnect_9FINAL(lines 1444 1446) no Hoare annotation was computed. [2018-01-25 03:38:48,628 INFO L401 ceAbstractionStarter]: For program point disconnect_9Err0RequiresViolation(lines 1 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,628 INFO L401 ceAbstractionStarter]: For program point disconnect_9Err1RequiresViolation(lines 1 1458) no Hoare annotation was computed. [2018-01-25 03:38:48,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:38:48 BoogieIcfgContainer [2018-01-25 03:38:48,634 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:38:48,635 INFO L168 Benchmark]: Toolchain (without parser) took 3807.99 ms. Allocated memory was 295.2 MB in the beginning and 464.5 MB in the end (delta: 169.3 MB). Free memory was 254.1 MB in the beginning and 376.1 MB in the end (delta: -122.1 MB). Peak memory consumption was 47.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:48,638 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 295.2 MB. Free memory is still 260.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:38:48,642 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.82 ms. Allocated memory is still 295.2 MB. Free memory was 254.1 MB in the beginning and 240.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:48,642 INFO L168 Benchmark]: Boogie Preprocessor took 50.03 ms. Allocated memory is still 295.2 MB. Free memory is still 240.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:38:48,642 INFO L168 Benchmark]: RCFGBuilder took 226.03 ms. Allocated memory is still 295.2 MB. Free memory was 240.0 MB in the beginning and 225.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:48,643 INFO L168 Benchmark]: TraceAbstraction took 3278.24 ms. Allocated memory was 295.2 MB in the beginning and 464.5 MB in the end (delta: 169.3 MB). Free memory was 225.1 MB in the beginning and 376.1 MB in the end (delta: -151.1 MB). Peak memory consumption was 18.3 MB. Max. memory is 5.3 GB. [2018-01-25 03:38:48,645 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.25 ms. Allocated memory is still 295.2 MB. Free memory is still 260.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 244.82 ms. Allocated memory is still 295.2 MB. Free memory was 254.1 MB in the beginning and 240.0 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 50.03 ms. Allocated memory is still 295.2 MB. Free memory is still 240.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * RCFGBuilder took 226.03 ms. Allocated memory is still 295.2 MB. Free memory was 240.0 MB in the beginning and 225.1 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3278.24 ms. Allocated memory was 295.2 MB in the beginning and 464.5 MB in the end (delta: 169.3 MB). Free memory was 225.1 MB in the beginning and 376.1 MB in the end (delta: -151.1 MB). Peak memory consumption was 18.3 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, 3.1s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 241 SDtfs, 87 SDslu, 604 SDs, 0 SdLazy, 283 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s 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.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s 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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-38-48-657.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_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-38-48-657.csv Received shutdown request...