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_mostprecise.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:49:00,591 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:49:00,592 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:49:00,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:49:00,607 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:49:00,608 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:49:00,609 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:49:00,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:49:00,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:49:00,614 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:49:00,615 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:49:00,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:49:00,616 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:49:00,618 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:49:00,618 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:49:00,621 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:49:00,623 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:49:00,625 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:49:00,627 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:49:00,628 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:49:00,631 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:49:00,631 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:49:00,631 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:49:00,632 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:49:00,633 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:49:00,635 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:49:00,635 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:49:00,636 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:49:00,636 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:49:00,636 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:49:00,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:49:00,637 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_mostprecise.epf [2018-01-24 20:49:00,646 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:49:00,646 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:49:00,647 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:49:00,647 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:49:00,647 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:49:00,647 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:49:00,647 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:49:00,647 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:49:00,648 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:49:00,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:49:00,648 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:49:00,648 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:49:00,649 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:49:00,650 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:49:00,650 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:49:00,650 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:49:00,650 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:49:00,650 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:49:00,651 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:49:00,651 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:49:00,651 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:49:00,651 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:49:00,651 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:49:00,651 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:49:00,651 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:49:00,652 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:49:00,652 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:49:00,652 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:49:00,653 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:49:00,653 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:49:00,688 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:49:00,701 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:49:00,705 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:49:00,706 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:49:00,706 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:49:00,707 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/memleaks_test8_true-valid-memsafety_true-termination.i [2018-01-24 20:49:00,877 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:49:00,884 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:49:00,885 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:49:00,885 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:49:00,892 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:49:00,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:49:00" (1/1) ... [2018-01-24 20:49:00,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42577689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:00, skipping insertion in model container [2018-01-24 20:49:00,896 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:49:00" (1/1) ... [2018-01-24 20:49:00,909 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:49:00,957 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:49:01,074 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:49:01,088 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:49:01,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01 WrapperNode [2018-01-24 20:49:01,094 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:49:01,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:49:01,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:49:01,095 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:49:01,113 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... [2018-01-24 20:49:01,114 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... [2018-01-24 20:49:01,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... [2018-01-24 20:49:01,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... [2018-01-24 20:49:01,130 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... [2018-01-24 20:49:01,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... [2018-01-24 20:49:01,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... [2018-01-24 20:49:01,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:49:01,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:49:01,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:49:01,136 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:49:01,138 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:49:01,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:49:01,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:49:01,199 INFO L136 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2018-01-24 20:49:01,199 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_8 [2018-01-24 20:49:01,200 INFO L136 BoogieDeclarations]: Found implementation of procedure free_8 [2018-01-24 20:49:01,200 INFO L136 BoogieDeclarations]: Found implementation of procedure entry_point [2018-01-24 20:49:01,200 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:49:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:49:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:49:01,200 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure ldv_malloc [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_8 [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure free_8 [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure entry_point [2018-01-24 20:49:01,201 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:49:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:49:01,202 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:49:01,367 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:49:01,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:49:01 BoogieIcfgContainer [2018-01-24 20:49:01,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:49:01,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:49:01,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:49:01,370 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:49:01,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:49:00" (1/3) ... [2018-01-24 20:49:01,371 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557b44a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:49:01, skipping insertion in model container [2018-01-24 20:49:01,371 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:49:01" (2/3) ... [2018-01-24 20:49:01,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@557b44a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:49:01, skipping insertion in model container [2018-01-24 20:49:01,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:49:01" (3/3) ... [2018-01-24 20:49:01,373 INFO L105 eAbstractionObserver]: Analyzing ICFG memleaks_test8_true-valid-memsafety_true-termination.i [2018-01-24 20:49:01,380 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:49:01,386 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-01-24 20:49:01,424 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:49:01,425 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:49:01,425 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:49:01,425 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:49:01,425 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:49:01,425 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:49:01,425 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:49:01,425 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:49:01,426 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:49:01,449 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-01-24 20:49:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:49:01,455 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:01,456 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:49:01,457 INFO L371 AbstractCegarLoop]: === Iteration 1 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:01,463 INFO L82 PathProgramCache]: Analyzing trace with hash 132716426, now seen corresponding path program 1 times [2018-01-24 20:49:01,466 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:01,519 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:01,520 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:01,520 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:01,520 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:01,577 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:01,690 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 20:49:01,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:01,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:49:01,692 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:01,695 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:49:01,705 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:49:01,705 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:49:01,707 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 5 states. [2018-01-24 20:49:01,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:01,869 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-01-24 20:49:01,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:49:01,871 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 20:49:01,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:01,881 INFO L225 Difference]: With dead ends: 42 [2018-01-24 20:49:01,881 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 20:49:01,884 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:49:01,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 20:49:01,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-01-24 20:49:01,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-24 20:49:01,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-01-24 20:49:01,919 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-01-24 20:49:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:01,920 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-01-24 20:49:01,920 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:49:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-01-24 20:49:01,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-24 20:49:01,921 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:01,921 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:49:01,921 INFO L371 AbstractCegarLoop]: === Iteration 2 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:01,921 INFO L82 PathProgramCache]: Analyzing trace with hash 132716427, now seen corresponding path program 1 times [2018-01-24 20:49:01,921 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:01,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:01,924 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:01,924 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:01,924 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:01,943 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:02,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:49:02,001 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:02,001 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:49:02,001 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:02,002 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:49:02,002 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:49:02,003 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:49:02,003 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-01-24 20:49:02,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:02,070 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-01-24 20:49:02,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:49:02,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-01-24 20:49:02,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:02,072 INFO L225 Difference]: With dead ends: 41 [2018-01-24 20:49:02,072 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 20:49:02,074 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:49:02,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 20:49:02,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-01-24 20:49:02,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-01-24 20:49:02,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2018-01-24 20:49:02,084 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 18 [2018-01-24 20:49:02,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:02,085 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2018-01-24 20:49:02,085 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:49:02,085 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-01-24 20:49:02,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:49:02,086 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:02,086 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 20:49:02,086 INFO L371 AbstractCegarLoop]: === Iteration 3 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:02,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1026806264, now seen corresponding path program 1 times [2018-01-24 20:49:02,087 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:02,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,089 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:02,089 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,089 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:02,111 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:02,178 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 20:49:02,179 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:02,179 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:49:02,179 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:02,179 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:49:02,180 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:49:02,180 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:49:02,180 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 6 states. [2018-01-24 20:49:02,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:02,267 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-01-24 20:49:02,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:49:02,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 20:49:02,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:02,269 INFO L225 Difference]: With dead ends: 39 [2018-01-24 20:49:02,269 INFO L226 Difference]: Without dead ends: 38 [2018-01-24 20:49:02,269 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 20:49:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-24 20:49:02,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-01-24 20:49:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-01-24 20:49:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2018-01-24 20:49:02,277 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 20 [2018-01-24 20:49:02,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:02,278 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2018-01-24 20:49:02,278 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:49:02,278 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2018-01-24 20:49:02,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:49:02,279 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:02,280 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 20:49:02,280 INFO L371 AbstractCegarLoop]: === Iteration 4 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:02,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1026806263, now seen corresponding path program 1 times [2018-01-24 20:49:02,280 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:02,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,282 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:02,282 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,282 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:02,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:02,300 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:02,354 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 20:49:02,354 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:02,354 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 20:49:02,355 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:02,355 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:49:02,355 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:49:02,355 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:49:02,355 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand 6 states. [2018-01-24 20:49:02,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:02,459 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-01-24 20:49:02,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:49:02,460 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-01-24 20:49:02,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:02,461 INFO L225 Difference]: With dead ends: 41 [2018-01-24 20:49:02,461 INFO L226 Difference]: Without dead ends: 40 [2018-01-24 20:49:02,462 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 20:49:02,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-01-24 20:49:02,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2018-01-24 20:49:02,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 20:49:02,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-01-24 20:49:02,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2018-01-24 20:49:02,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:02,469 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-01-24 20:49:02,469 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:49:02,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-01-24 20:49:02,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-24 20:49:02,470 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:02,470 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:49:02,470 INFO L371 AbstractCegarLoop]: === Iteration 5 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:02,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1070854066, now seen corresponding path program 1 times [2018-01-24 20:49:02,471 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:02,472 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,473 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:02,473 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,473 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:02,485 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:02,519 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 20:49:02,520 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:02,520 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:49:02,520 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:02,520 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:49:02,521 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:49:02,521 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:49:02,521 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2018-01-24 20:49:02,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:02,557 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2018-01-24 20:49:02,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:49:02,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-01-24 20:49:02,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:02,559 INFO L225 Difference]: With dead ends: 40 [2018-01-24 20:49:02,559 INFO L226 Difference]: Without dead ends: 35 [2018-01-24 20:49:02,560 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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 20:49:02,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-01-24 20:49:02,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-01-24 20:49:02,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-24 20:49:02,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2018-01-24 20:49:02,570 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 23 [2018-01-24 20:49:02,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:02,571 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2018-01-24 20:49:02,571 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:49:02,571 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-01-24 20:49:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-24 20:49:02,572 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:02,572 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 20:49:02,572 INFO L371 AbstractCegarLoop]: === Iteration 6 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash -980957032, now seen corresponding path program 1 times [2018-01-24 20:49:02,573 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:02,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,574 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:02,574 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,574 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:02,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:02,654 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 20:49:02,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:02,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:49:02,655 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:02,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 20:49:02,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 20:49:02,656 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:49:02,656 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand 6 states. [2018-01-24 20:49:02,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:02,742 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-01-24 20:49:02,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:49:02,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-01-24 20:49:02,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:02,743 INFO L225 Difference]: With dead ends: 45 [2018-01-24 20:49:02,743 INFO L226 Difference]: Without dead ends: 30 [2018-01-24 20:49:02,744 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:49:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-01-24 20:49:02,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-01-24 20:49:02,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 20:49:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-01-24 20:49:02,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-01-24 20:49:02,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:02,748 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-01-24 20:49:02,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 20:49:02,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-01-24 20:49:02,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-24 20:49:02,749 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:02,749 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:49:02,749 INFO L371 AbstractCegarLoop]: === Iteration 7 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:02,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1127655280, now seen corresponding path program 1 times [2018-01-24 20:49:02,749 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:02,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:02,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,751 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:02,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:02,764 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:02,827 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 20:49:02,827 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:02,827 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:49:02,827 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:02,828 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:49:02,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:49:02,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:49:02,829 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 7 states. [2018-01-24 20:49:02,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:02,906 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2018-01-24 20:49:02,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 20:49:02,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-01-24 20:49:02,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:02,908 INFO L225 Difference]: With dead ends: 34 [2018-01-24 20:49:02,908 INFO L226 Difference]: Without dead ends: 27 [2018-01-24 20:49:02,909 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:49:02,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-01-24 20:49:02,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-01-24 20:49:02,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-01-24 20:49:02,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2018-01-24 20:49:02,913 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 25 [2018-01-24 20:49:02,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:02,913 INFO L432 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2018-01-24 20:49:02,914 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:49:02,914 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2018-01-24 20:49:02,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-24 20:49:02,914 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:49:02,914 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 20:49:02,914 INFO L371 AbstractCegarLoop]: === Iteration 8 === [free_8Err0RequiresViolation, free_8Err1RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-24 20:49:02,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1553172630, now seen corresponding path program 1 times [2018-01-24 20:49:02,915 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:49:02,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,916 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:49:02,916 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:49:02,916 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:49:02,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:49:02,931 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:49:03,141 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 20:49:03,142 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:49:03,142 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:49:03,142 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:49:03,143 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:49:03,143 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:49:03,143 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:49:03,143 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 9 states. [2018-01-24 20:49:03,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:49:03,331 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2018-01-24 20:49:03,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:49:03,331 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 26 [2018-01-24 20:49:03,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:49:03,332 INFO L225 Difference]: With dead ends: 27 [2018-01-24 20:49:03,332 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 20:49:03,332 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:49:03,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 20:49:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 20:49:03,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 20:49:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 20:49:03,333 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-24 20:49:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:49:03,333 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 20:49:03,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:49:03,333 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 20:49:03,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 20:49:03,337 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 20:49:03,571 INFO L401 ceAbstractionStarter]: For program point L1441''(line 1441) no Hoare annotation was computed. [2018-01-24 20:49:03,572 INFO L401 ceAbstractionStarter]: For program point free_8Err1RequiresViolation(lines 1 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,573 INFO L401 ceAbstractionStarter]: For program point free_8Err0RequiresViolation(lines 1 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,573 INFO L397 ceAbstractionStarter]: At program point free_8ENTRY(lines 1440 1442) the Hoare annotation is: (or (let ((.cse0 (not (= 0 ~a8.offset)))) (and (or .cse0 (not (= (select |old(#valid)| ~a8.base) 1))) (or .cse0 (not (= 0 ~a8.base))))) (= |#valid| |old(#valid)|)) [2018-01-24 20:49:03,573 INFO L401 ceAbstractionStarter]: For program point free_8EXIT(lines 1440 1442) no Hoare annotation was computed. [2018-01-24 20:49:03,573 INFO L401 ceAbstractionStarter]: For program point L1441(line 1441) no Hoare annotation was computed. [2018-01-24 20:49:03,574 INFO L397 ceAbstractionStarter]: At program point ldv_mallocENTRY(lines 1072 1078) the Hoare annotation is: (or (not (= 0 ~a8.offset)) (not (= 0 ~a8.base)) (= |#valid| |old(#valid)|)) [2018-01-24 20:49:03,574 INFO L401 ceAbstractionStarter]: For program point L1073(lines 1073 1077) no Hoare annotation was computed. [2018-01-24 20:49:03,574 INFO L401 ceAbstractionStarter]: For program point L1074'(line 1074) no Hoare annotation was computed. [2018-01-24 20:49:03,574 INFO L401 ceAbstractionStarter]: For program point ldv_mallocEXIT(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 20:49:03,574 INFO L401 ceAbstractionStarter]: For program point ldv_mallocFINAL(lines 1072 1078) no Hoare annotation was computed. [2018-01-24 20:49:03,575 INFO L401 ceAbstractionStarter]: For program point L1074(line 1074) no Hoare annotation was computed. [2018-01-24 20:49:03,575 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,575 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 1452) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 20:49:03,575 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,575 INFO L397 ceAbstractionStarter]: At program point alloc_8ENTRY(lines 1436 1438) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-24 20:49:03,575 INFO L401 ceAbstractionStarter]: For program point alloc_8EXIT(lines 1436 1438) no Hoare annotation was computed. [2018-01-24 20:49:03,576 INFO L401 ceAbstractionStarter]: For program point L1437(line 1437) no Hoare annotation was computed. [2018-01-24 20:49:03,576 INFO L401 ceAbstractionStarter]: For program point alloc_8FINAL(lines 1436 1438) no Hoare annotation was computed. [2018-01-24 20:49:03,576 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 1452) the Hoare annotation is: true [2018-01-24 20:49:03,576 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,576 INFO L397 ceAbstractionStarter]: At program point L1(lines 1 1452) the Hoare annotation is: (and (= ~a8.offset 0) (= 0 ~a8.base)) [2018-01-24 20:49:03,576 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,577 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 1450 1452) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-24 20:49:03,577 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 1450 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,577 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 1450 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,577 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 1450 1452) no Hoare annotation was computed. [2018-01-24 20:49:03,577 INFO L397 ceAbstractionStarter]: At program point entry_pointENTRY(lines 1444 1448) the Hoare annotation is: (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= ~a8.offset 0) (= |#valid| |old(#valid)|) (= 0 ~a8.base))) [2018-01-24 20:49:03,577 INFO L401 ceAbstractionStarter]: For program point entry_pointFINAL(lines 1444 1448) no Hoare annotation was computed. [2018-01-24 20:49:03,577 INFO L397 ceAbstractionStarter]: At program point L1445(line 1445) the Hoare annotation is: (let ((.cse0 (= 0 ~a8.base))) (let ((.cse1 (let ((.cse3 (= ~a8.offset 0))) (or (and .cse3 (= 1 (select |#valid| ~a8.base))) (and .cse3 .cse0))))) (or (not (= 0 |old(~a8.offset)|)) (not (= 0 |old(~a8.base)|)) (and (= |#valid| |old(#valid)|) .cse0 .cse1) (let ((.cse2 (select |old(#valid)| ~a8.base))) (and (= (store |#valid| ~a8.base .cse2) |old(#valid)|) (not .cse0) .cse1 (= 0 .cse2)))))) [2018-01-24 20:49:03,578 INFO L401 ceAbstractionStarter]: For program point L1446(line 1446) no Hoare annotation was computed. [2018-01-24 20:49:03,578 INFO L401 ceAbstractionStarter]: For program point entry_pointEXIT(lines 1444 1448) no Hoare annotation was computed. [2018-01-24 20:49:03,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 08:49:03 BoogieIcfgContainer [2018-01-24 20:49:03,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 20:49:03,583 INFO L168 Benchmark]: Toolchain (without parser) took 2704.66 ms. Allocated memory was 304.1 MB in the beginning and 477.6 MB in the end (delta: 173.5 MB). Free memory was 263.0 MB in the beginning and 399.1 MB in the end (delta: -136.2 MB). Peak memory consumption was 37.4 MB. Max. memory is 5.3 GB. [2018-01-24 20:49:03,584 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 20:49:03,585 INFO L168 Benchmark]: CACSL2BoogieTranslator took 209.81 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 250.7 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. [2018-01-24 20:49:03,585 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 ms. Allocated memory is still 304.1 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:49:03,585 INFO L168 Benchmark]: RCFGBuilder took 231.47 ms. Allocated memory is still 304.1 MB. Free memory was 248.7 MB in the beginning and 234.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. [2018-01-24 20:49:03,586 INFO L168 Benchmark]: TraceAbstraction took 2213.60 ms. Allocated memory was 304.1 MB in the beginning and 477.6 MB in the end (delta: 173.5 MB). Free memory was 234.8 MB in the beginning and 399.1 MB in the end (delta: -164.4 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. [2018-01-24 20:49:03,588 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.15 ms. Allocated memory is still 304.1 MB. Free memory is still 270.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 209.81 ms. Allocated memory is still 304.1 MB. Free memory was 263.0 MB in the beginning and 250.7 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.79 ms. Allocated memory is still 304.1 MB. Free memory was 250.7 MB in the beginning and 248.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 231.47 ms. Allocated memory is still 304.1 MB. Free memory was 248.7 MB in the beginning and 234.8 MB in the end (delta: 14.0 MB). Peak memory consumption was 14.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2213.60 ms. Allocated memory was 304.1 MB in the beginning and 477.6 MB in the end (delta: 173.5 MB). Free memory was 234.8 MB in the beginning and 399.1 MB in the end (delta: -164.4 MB). Peak memory consumption was 9.2 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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 - PositiveResult [Line: 1450]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 32 locations, 3 error locations. SAFE Result, 2.1s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 207 SDtfs, 131 SDslu, 486 SDs, 0 SdLazy, 274 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=2, 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, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 10 PreInvPairs, 11 NumberOfFragments, 173 HoareAnnotationTreeSize, 10 FomulaSimplifications, 28 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 64 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 12081 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_test8_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_20-49-03-597.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/memleaks_test8_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_mostprecise.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_20-49-03-597.csv Received shutdown request...