java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-acfac67 [2018-01-28 21:36:38,604 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-28 21:36:38,605 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-28 21:36:38,617 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-28 21:36:38,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-28 21:36:38,618 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-28 21:36:38,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-28 21:36:38,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-28 21:36:38,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-28 21:36:38,623 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-28 21:36:38,624 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-28 21:36:38,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-28 21:36:38,625 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-28 21:36:38,627 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-28 21:36:38,628 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-28 21:36:38,630 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-28 21:36:38,632 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-28 21:36:38,634 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-28 21:36:38,635 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-28 21:36:38,636 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-28 21:36:38,638 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-28 21:36:38,638 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-28 21:36:38,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-28 21:36:38,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-28 21:36:38,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-28 21:36:38,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-28 21:36:38,641 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-28 21:36:38,642 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-28 21:36:38,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-28 21:36:38,642 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-28 21:36:38,643 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-28 21:36:38,643 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-28 21:36:38,653 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-28 21:36:38,653 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-28 21:36:38,654 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-28 21:36:38,654 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-28 21:36:38,654 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-28 21:36:38,655 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-28 21:36:38,655 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-28 21:36:38,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-28 21:36:38,656 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-28 21:36:38,656 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-28 21:36:38,656 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-28 21:36:38,656 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-28 21:36:38,656 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-28 21:36:38,657 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-28 21:36:38,657 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-28 21:36:38,657 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-28 21:36:38,657 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-28 21:36:38,657 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-28 21:36:38,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-28 21:36:38,658 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-28 21:36:38,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-28 21:36:38,658 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-28 21:36:38,658 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-28 21:36:38,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-28 21:36:38,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-28 21:36:38,659 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-28 21:36:38,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-28 21:36:38,659 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-28 21:36:38,659 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-28 21:36:38,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-28 21:36:38,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-28 21:36:38,660 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-28 21:36:38,661 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-28 21:36:38,661 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-28 21:36:38,694 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-28 21:36:38,706 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-28 21:36:38,709 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-28 21:36:38,710 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-28 21:36:38,710 INFO L276 PluginConnector]: CDTParser initialized [2018-01-28 21:36:38,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety/test-0019_true-valid-memsafety_true-termination.i [2018-01-28 21:36:38,885 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-28 21:36:38,892 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-28 21:36:38,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-28 21:36:38,894 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-28 21:36:38,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-28 21:36:38,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:36:38" (1/1) ... [2018-01-28 21:36:38,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@672cf497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:38, skipping insertion in model container [2018-01-28 21:36:38,904 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 09:36:38" (1/1) ... [2018-01-28 21:36:38,916 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:36:38,950 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-28 21:36:39,059 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:36:39,074 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-28 21:36:39,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39 WrapperNode [2018-01-28 21:36:39,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-28 21:36:39,081 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-28 21:36:39,081 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-28 21:36:39,081 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-28 21:36:39,097 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (1/1) ... [2018-01-28 21:36:39,097 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (1/1) ... [2018-01-28 21:36:39,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (1/1) ... [2018-01-28 21:36:39,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (1/1) ... [2018-01-28 21:36:39,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (1/1) ... [2018-01-28 21:36:39,115 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (1/1) ... [2018-01-28 21:36:39,115 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (1/1) ... [2018-01-28 21:36:39,117 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-28 21:36:39,117 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-28 21:36:39,117 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-28 21:36:39,117 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-28 21:36:39,118 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (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-28 21:36:39,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-28 21:36:39,163 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-28 21:36:39,163 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-28 21:36:39,164 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-28 21:36:39,164 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-28 21:36:39,164 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-28 21:36:39,165 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-28 21:36:39,165 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-28 21:36:39,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-28 21:36:39,165 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-28 21:36:39,345 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-28 21:36:39,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:36:39 BoogieIcfgContainer [2018-01-28 21:36:39,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-28 21:36:39,346 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-28 21:36:39,346 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-28 21:36:39,349 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-28 21:36:39,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 09:36:38" (1/3) ... [2018-01-28 21:36:39,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249e39c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:36:39, skipping insertion in model container [2018-01-28 21:36:39,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 09:36:39" (2/3) ... [2018-01-28 21:36:39,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@249e39c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 09:36:39, skipping insertion in model container [2018-01-28 21:36:39,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 09:36:39" (3/3) ... [2018-01-28 21:36:39,353 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_true-valid-memsafety_true-termination.i [2018-01-28 21:36:39,362 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-28 21:36:39,369 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2018-01-28 21:36:39,412 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-28 21:36:39,412 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-28 21:36:39,412 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-28 21:36:39,412 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-28 21:36:39,412 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-28 21:36:39,412 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-28 21:36:39,412 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-28 21:36:39,412 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-28 21:36:39,413 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-28 21:36:39,429 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-01-28 21:36:39,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-28 21:36:39,434 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:39,435 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:36:39,435 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:39,439 INFO L82 PathProgramCache]: Analyzing trace with hash 905336209, now seen corresponding path program 1 times [2018-01-28 21:36:39,442 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:39,442 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:39,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:39,482 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:39,482 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:39,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:39,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:39,713 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-28 21:36:39,715 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:39,715 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-28 21:36:39,716 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-28 21:36:39,725 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-28 21:36:39,726 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-28 21:36:39,728 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 5 states. [2018-01-28 21:36:39,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:39,987 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-01-28 21:36:39,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:36:39,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-28 21:36:39,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:39,997 INFO L225 Difference]: With dead ends: 48 [2018-01-28 21:36:39,997 INFO L226 Difference]: Without dead ends: 41 [2018-01-28 21:36:40,000 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:36:40,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-01-28 21:36:40,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-01-28 21:36:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-28 21:36:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-01-28 21:36:40,029 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 11 [2018-01-28 21:36:40,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:40,029 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-01-28 21:36:40,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-28 21:36:40,030 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-01-28 21:36:40,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-28 21:36:40,030 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:40,030 INFO L330 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-28 21:36:40,030 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:40,031 INFO L82 PathProgramCache]: Analyzing trace with hash 905336210, now seen corresponding path program 1 times [2018-01-28 21:36:40,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:40,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:40,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:40,032 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:40,032 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:40,053 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:40,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-28 21:36:40,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:40,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-28 21:36:40,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-28 21:36:40,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-28 21:36:40,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-28 21:36:40,176 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 6 states. [2018-01-28 21:36:40,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:40,454 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-01-28 21:36:40,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-28 21:36:40,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-01-28 21:36:40,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:40,456 INFO L225 Difference]: With dead ends: 41 [2018-01-28 21:36:40,456 INFO L226 Difference]: Without dead ends: 37 [2018-01-28 21:36:40,456 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-28 21:36:40,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-01-28 21:36:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-01-28 21:36:40,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-01-28 21:36:40,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-01-28 21:36:40,462 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 11 [2018-01-28 21:36:40,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:40,463 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-01-28 21:36:40,463 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-28 21:36:40,463 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-01-28 21:36:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 21:36:40,463 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:40,464 INFO L330 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-28 21:36:40,464 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash -933023545, now seen corresponding path program 1 times [2018-01-28 21:36:40,464 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:40,464 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:40,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:40,465 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:40,465 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:40,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:40,486 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:40,651 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-28 21:36:40,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:40,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:36:40,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:36:40,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:36:40,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:36:40,653 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 11 states. [2018-01-28 21:36:40,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:40,794 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-01-28 21:36:40,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-28 21:36:40,794 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-28 21:36:40,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:40,795 INFO L225 Difference]: With dead ends: 37 [2018-01-28 21:36:40,795 INFO L226 Difference]: Without dead ends: 36 [2018-01-28 21:36:40,796 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:36:40,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-28 21:36:40,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-01-28 21:36:40,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-01-28 21:36:40,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-01-28 21:36:40,800 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2018-01-28 21:36:40,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:40,801 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-01-28 21:36:40,801 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:36:40,801 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-01-28 21:36:40,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-28 21:36:40,802 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:40,802 INFO L330 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-28 21:36:40,802 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:40,802 INFO L82 PathProgramCache]: Analyzing trace with hash -933023544, now seen corresponding path program 1 times [2018-01-28 21:36:40,802 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:40,802 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:40,803 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:40,803 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:40,804 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:40,824 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:40,969 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-28 21:36:40,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:40,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:36:40,970 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:36:40,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:36:40,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:36:40,970 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 11 states. [2018-01-28 21:36:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:41,141 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-01-28 21:36:41,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:36:41,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2018-01-28 21:36:41,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:41,142 INFO L225 Difference]: With dead ends: 39 [2018-01-28 21:36:41,142 INFO L226 Difference]: Without dead ends: 38 [2018-01-28 21:36:41,143 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=168, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:36:41,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-01-28 21:36:41,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-01-28 21:36:41,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-01-28 21:36:41,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-01-28 21:36:41,148 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 23 [2018-01-28 21:36:41,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:41,149 INFO L432 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-01-28 21:36:41,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:36:41,149 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-01-28 21:36:41,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 21:36:41,150 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:41,150 INFO L330 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-28 21:36:41,150 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:41,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1141041189, now seen corresponding path program 1 times [2018-01-28 21:36:41,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:41,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:41,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:41,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:41,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:41,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:41,172 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:41,348 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-28 21:36:41,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:41,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-28 21:36:41,349 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-28 21:36:41,349 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-28 21:36:41,349 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-28 21:36:41,349 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 11 states. [2018-01-28 21:36:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:41,471 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-01-28 21:36:41,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-28 21:36:41,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 24 [2018-01-28 21:36:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:41,472 INFO L225 Difference]: With dead ends: 35 [2018-01-28 21:36:41,473 INFO L226 Difference]: Without dead ends: 34 [2018-01-28 21:36:41,473 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2018-01-28 21:36:41,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-01-28 21:36:41,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-01-28 21:36:41,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-01-28 21:36:41,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-01-28 21:36:41,478 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2018-01-28 21:36:41,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:41,479 INFO L432 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-01-28 21:36:41,479 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-28 21:36:41,479 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-01-28 21:36:41,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-28 21:36:41,480 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:41,480 INFO L330 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-28 21:36:41,480 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:41,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1141041190, now seen corresponding path program 1 times [2018-01-28 21:36:41,480 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:41,480 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:41,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:41,481 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:41,481 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:41,499 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:42,009 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-28 21:36:42,009 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:42,009 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-01-28 21:36:42,009 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-01-28 21:36:42,010 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-01-28 21:36:42,010 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-01-28 21:36:42,010 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 17 states. [2018-01-28 21:36:42,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:42,480 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-01-28 21:36:42,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-28 21:36:42,524 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 24 [2018-01-28 21:36:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:42,525 INFO L225 Difference]: With dead ends: 37 [2018-01-28 21:36:42,525 INFO L226 Difference]: Without dead ends: 36 [2018-01-28 21:36:42,525 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2018-01-28 21:36:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-01-28 21:36:42,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2018-01-28 21:36:42,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-28 21:36:42,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-01-28 21:36:42,529 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 24 [2018-01-28 21:36:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:42,529 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-01-28 21:36:42,529 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-01-28 21:36:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-01-28 21:36:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-28 21:36:42,530 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:42,530 INFO L330 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, 1, 1] [2018-01-28 21:36:42,530 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:42,530 INFO L82 PathProgramCache]: Analyzing trace with hash 497067148, now seen corresponding path program 1 times [2018-01-28 21:36:42,530 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:42,530 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:42,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:42,531 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:42,531 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:42,547 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:42,792 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-28 21:36:42,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:42,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-01-28 21:36:42,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-28 21:36:42,793 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-28 21:36:42,793 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2018-01-28 21:36:42,794 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 15 states. [2018-01-28 21:36:42,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:42,990 INFO L93 Difference]: Finished difference Result 42 states and 41 transitions. [2018-01-28 21:36:42,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-28 21:36:42,990 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 30 [2018-01-28 21:36:42,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:42,991 INFO L225 Difference]: With dead ends: 42 [2018-01-28 21:36:42,991 INFO L226 Difference]: Without dead ends: 33 [2018-01-28 21:36:42,992 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2018-01-28 21:36:42,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-01-28 21:36:42,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-01-28 21:36:42,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-01-28 21:36:42,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 32 transitions. [2018-01-28 21:36:42,997 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 32 transitions. Word has length 30 [2018-01-28 21:36:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:42,997 INFO L432 AbstractCegarLoop]: Abstraction has 33 states and 32 transitions. [2018-01-28 21:36:42,997 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-28 21:36:42,997 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 32 transitions. [2018-01-28 21:36:42,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-28 21:36:42,998 INFO L322 BasicCegarLoop]: Found error trace [2018-01-28 21:36:42,999 INFO L330 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, 1, 1, 1, 1] [2018-01-28 21:36:42,999 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr2RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr2RequiresViolation, free_dataErr0RequiresViolation]=== [2018-01-28 21:36:42,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1654516016, now seen corresponding path program 1 times [2018-01-28 21:36:42,999 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-28 21:36:42,999 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-28 21:36:43,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:43,000 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-28 21:36:43,000 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-28 21:36:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-28 21:36:43,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-28 21:36:43,790 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-28 21:36:43,791 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-28 21:36:43,791 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2018-01-28 21:36:43,791 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-28 21:36:43,791 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-28 21:36:43,791 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2018-01-28 21:36:43,791 INFO L87 Difference]: Start difference. First operand 33 states and 32 transitions. Second operand 19 states. [2018-01-28 21:36:44,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-28 21:36:44,501 INFO L93 Difference]: Finished difference Result 33 states and 32 transitions. [2018-01-28 21:36:44,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-28 21:36:44,501 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 32 [2018-01-28 21:36:44,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-28 21:36:44,501 INFO L225 Difference]: With dead ends: 33 [2018-01-28 21:36:44,502 INFO L226 Difference]: Without dead ends: 0 [2018-01-28 21:36:44,502 INFO L533 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2018-01-28 21:36:44,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-28 21:36:44,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-28 21:36:44,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-28 21:36:44,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-28 21:36:44,503 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-01-28 21:36:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-28 21:36:44,503 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-28 21:36:44,503 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-28 21:36:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-28 21:36:44,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-28 21:36:44,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-28 21:36:44,695 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 80 DAG size of output 56 [2018-01-28 21:36:44,733 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,733 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,733 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 642) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:36:44,733 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,734 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 642) the Hoare annotation is: true [2018-01-28 21:36:44,734 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,734 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 642) the Hoare annotation is: true [2018-01-28 21:36:44,734 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,734 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,734 INFO L399 ceAbstractionStarter]: For program point alloc_dataEXIT(lines 623 627) no Hoare annotation was computed. [2018-01-28 21:36:44,734 INFO L399 ceAbstractionStarter]: For program point L625'(line 625) no Hoare annotation was computed. [2018-01-28 21:36:44,734 INFO L399 ceAbstractionStarter]: For program point alloc_dataFINAL(lines 623 627) no Hoare annotation was computed. [2018-01-28 21:36:44,735 INFO L395 ceAbstractionStarter]: At program point alloc_dataENTRY(lines 623 627) the Hoare annotation is: (or (not (= 0 |alloc_data_#in~pdata.offset|)) (not (= (select |old(#valid)| |alloc_data_#in~pdata.base|) 1)) (and (= |#valid| |old(#valid)|) (= 8 (select |#length| |alloc_data_#in~pdata.base|))) (not (= 8 (select |old(#length)| |alloc_data_#in~pdata.base|)))) [2018-01-28 21:36:44,735 INFO L399 ceAbstractionStarter]: For program point L625''(line 625) no Hoare annotation was computed. [2018-01-28 21:36:44,735 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,735 INFO L399 ceAbstractionStarter]: For program point L626(line 626) no Hoare annotation was computed. [2018-01-28 21:36:44,735 INFO L399 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-01-28 21:36:44,735 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,735 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,735 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,736 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,736 INFO L399 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-28 21:36:44,736 INFO L399 ceAbstractionStarter]: For program point L640(line 640) no Hoare annotation was computed. [2018-01-28 21:36:44,736 INFO L399 ceAbstractionStarter]: For program point L640''(line 640) no Hoare annotation was computed. [2018-01-28 21:36:44,737 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 637 642) no Hoare annotation was computed. [2018-01-28 21:36:44,737 INFO L395 ceAbstractionStarter]: At program point L640'(line 640) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.base| |main_~#data~5.base|)) (.cse3 (select |#memory_$Pointer$.offset| |main_~#data~5.base|)) (.cse5 (+ |main_~#data~5.offset| 4))) (let ((.cse2 (select .cse3 .cse5)) (.cse1 (select .cse4 .cse5)) (.cse0 (store (store |#valid| |main_#t~mem4.base| 0) |main_~#data~5.base| 0))) (and (= 1 (select |#valid| |main_#t~mem5.base|)) (= (store .cse0 .cse1 0) |old(#valid)|) (= 0 .cse2) (= .cse2 (select .cse3 |main_~#data~5.offset|)) (not (= |main_~#data~5.base| |main_#t~mem5.base|)) (= 1 (select |#valid| |main_~#data~5.base|)) (not (= |main_~#data~5.base| |main_#t~mem4.base|)) (= 1 (select |#valid| |main_#t~mem4.base|)) (= 0 |main_#t~mem4.offset|) (= (store (store (store |#valid| (select .cse4 |main_~#data~5.offset|) 0) |main_~#data~5.base| 0) .cse1 0) |old(#valid)|) (= (store .cse0 |main_#t~mem5.base| 0) |old(#valid)|) (= 8 (select |#length| |main_~#data~5.base|)) (not (= |main_#t~mem4.base| |main_#t~mem5.base|)) (not (= 0 |main_#t~mem4.base|)) (not (= 0 |main_#t~mem5.base|)) (= 0 |main_~#data~5.offset|) (= 0 |main_#t~mem5.offset|)))) [2018-01-28 21:36:44,737 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 637 642) no Hoare annotation was computed. [2018-01-28 21:36:44,737 INFO L395 ceAbstractionStarter]: At program point L638(line 638) the Hoare annotation is: (and (= 8 (select |#length| |main_~#data~5.base|)) (= (store |#valid| |main_~#data~5.base| 0) |old(#valid)|) (= 1 (select |#valid| |main_~#data~5.base|)) (= 0 |main_~#data~5.offset|)) [2018-01-28 21:36:44,737 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,737 INFO L399 ceAbstractionStarter]: For program point L638''(line 638) no Hoare annotation was computed. [2018-01-28 21:36:44,738 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 637 642) no Hoare annotation was computed. [2018-01-28 21:36:44,738 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 637 642) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-28 21:36:44,738 INFO L399 ceAbstractionStarter]: For program point L638'(line 638) no Hoare annotation was computed. [2018-01-28 21:36:44,738 INFO L399 ceAbstractionStarter]: For program point L639(line 639) no Hoare annotation was computed. [2018-01-28 21:36:44,738 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,738 INFO L399 ceAbstractionStarter]: For program point L640'''(line 640) no Hoare annotation was computed. [2018-01-28 21:36:44,738 INFO L399 ceAbstractionStarter]: For program point free_dataErr1RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,738 INFO L399 ceAbstractionStarter]: For program point L630(line 630) no Hoare annotation was computed. [2018-01-28 21:36:44,739 INFO L399 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-28 21:36:44,739 INFO L399 ceAbstractionStarter]: For program point L632(lines 632 633) no Hoare annotation was computed. [2018-01-28 21:36:44,739 INFO L399 ceAbstractionStarter]: For program point L631(line 631) no Hoare annotation was computed. [2018-01-28 21:36:44,739 INFO L399 ceAbstractionStarter]: For program point free_dataErr2RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,739 INFO L399 ceAbstractionStarter]: For program point free_dataErr0RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,739 INFO L399 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-28 21:36:44,739 INFO L395 ceAbstractionStarter]: At program point free_dataENTRY(lines 628 636) the Hoare annotation is: (or (= |#valid| |old(#valid)|) (= 0 |free_data_#in~data.lo.base|) (not (= (select |old(#valid)| |free_data_#in~data.hi.base|) 1)) (not (= 0 |free_data_#in~data.hi.offset|)) (not (= 0 |free_data_#in~data.lo.offset|)) (not (= 1 (select |old(#valid)| |free_data_#in~data.lo.base|)))) [2018-01-28 21:36:44,739 INFO L399 ceAbstractionStarter]: For program point free_dataFINAL(lines 628 636) no Hoare annotation was computed. [2018-01-28 21:36:44,740 INFO L399 ceAbstractionStarter]: For program point free_dataErr3RequiresViolation(lines 1 642) no Hoare annotation was computed. [2018-01-28 21:36:44,740 INFO L399 ceAbstractionStarter]: For program point free_dataEXIT(lines 628 636) no Hoare annotation was computed. [2018-01-28 21:36:44,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 09:36:44 BoogieIcfgContainer [2018-01-28 21:36:44,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-28 21:36:44,748 INFO L168 Benchmark]: Toolchain (without parser) took 5862.19 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 262.1 MB in the beginning and 441.6 MB in the end (delta: -179.5 MB). Peak memory consumption was 60.1 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:44,749 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 303.0 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-28 21:36:44,749 INFO L168 Benchmark]: CACSL2BoogieTranslator took 187.07 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:44,750 INFO L168 Benchmark]: Boogie Preprocessor took 35.94 ms. Allocated memory is still 303.0 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:44,750 INFO L168 Benchmark]: RCFGBuilder took 228.37 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 231.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:44,750 INFO L168 Benchmark]: TraceAbstraction took 5399.39 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 231.5 MB in the beginning and 441.6 MB in the end (delta: -210.1 MB). Peak memory consumption was 29.5 MB. Max. memory is 5.3 GB. [2018-01-28 21:36:44,752 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.12 ms. Allocated memory is still 303.0 MB. Free memory is still 268.1 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 187.07 ms. Allocated memory is still 303.0 MB. Free memory was 262.1 MB in the beginning and 252.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.94 ms. Allocated memory is still 303.0 MB. Free memory was 252.1 MB in the beginning and 250.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 228.37 ms. Allocated memory is still 303.0 MB. Free memory was 250.1 MB in the beginning and 231.5 MB in the end (delta: 18.6 MB). Peak memory consumption was 18.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5399.39 ms. Allocated memory was 303.0 MB in the beginning and 542.6 MB in the end (delta: 239.6 MB). Free memory was 231.5 MB in the beginning and 441.6 MB in the end (delta: -210.1 MB). Peak memory consumption was 29.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: 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 - 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 13 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 13 error locations. SAFE Result, 5.3s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 2.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 184 SDtfs, 227 SDslu, 940 SDs, 0 SdLazy, 1058 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 145 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 205 HoareAnnotationTreeSize, 8 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 152 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 178 NumberOfCodeBlocks, 178 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 48427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-28_21-36-44-759.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-28_21-36-44-759.csv Received shutdown request...