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/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 09:05:15,928 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 09:05:15,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 09:05:15,946 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 09:05:15,946 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 09:05:15,947 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 09:05:15,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 09:05:15,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 09:05:15,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 09:05:15,955 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 09:05:15,956 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 09:05:15,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 09:05:15,957 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 09:05:15,959 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 09:05:15,964 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 09:05:15,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 09:05:15,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 09:05:15,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 09:05:15,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 09:05:15,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 09:05:15,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 09:05:15,977 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 09:05:15,977 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 09:05:15,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 09:05:15,979 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 09:05:15,980 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 09:05:15,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 09:05:15,981 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 09:05:15,981 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 09:05:15,981 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 09:05:15,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 09:05:15,982 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-31 09:05:15,993 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 09:05:15,993 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 09:05:15,994 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 09:05:15,994 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 09:05:15,994 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 09:05:15,994 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 09:05:15,995 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 09:05:15,995 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 09:05:15,995 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 09:05:15,996 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 09:05:15,996 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 09:05:15,996 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 09:05:15,996 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 09:05:15,996 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 09:05:15,997 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 09:05:15,997 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 09:05:15,997 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 09:05:15,997 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 09:05:15,997 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 09:05:15,997 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 09:05:15,998 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 09:05:15,998 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 09:05:15,998 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 09:05:15,998 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 09:05:15,998 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 09:05:15,999 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 09:05:15,999 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 09:05:15,999 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 09:05:15,999 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 09:05:15,999 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 09:05:15,999 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 09:05:16,000 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 09:05:16,000 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 09:05:16,001 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 09:05:16,033 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 09:05:16,045 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 09:05:16,052 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 09:05:16,054 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 09:05:16,054 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 09:05:16,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-01-31 09:05:16,250 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 09:05:16,258 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 09:05:16,260 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 09:05:16,260 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 09:05:16,270 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 09:05:16,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,276 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a3b7e53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16, skipping insertion in model container [2018-01-31 09:05:16,276 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,295 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:05:16,354 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 09:05:16,501 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:05:16,522 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 09:05:16,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16 WrapperNode [2018-01-31 09:05:16,531 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 09:05:16,544 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 09:05:16,545 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 09:05:16,545 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 09:05:16,562 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,583 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (1/1) ... [2018-01-31 09:05:16,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 09:05:16,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 09:05:16,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 09:05:16,592 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 09:05:16,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (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-31 09:05:16,668 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 09:05:16,668 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 09:05:16,668 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-31 09:05:16,668 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-31 09:05:16,669 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 09:05:16,669 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-31 09:05:16,669 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-31 09:05:16,669 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 09:05:16,669 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 09:05:16,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 09:05:16,669 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 09:05:16,670 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 09:05:16,670 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-31 09:05:16,670 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-31 09:05:16,670 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-31 09:05:16,670 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-31 09:05:16,670 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 09:05:16,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 09:05:16,671 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 09:05:17,216 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 09:05:17,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:05:17 BoogieIcfgContainer [2018-01-31 09:05:17,217 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 09:05:17,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 09:05:17,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 09:05:17,222 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 09:05:17,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 09:05:16" (1/3) ... [2018-01-31 09:05:17,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5671269a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:05:17, skipping insertion in model container [2018-01-31 09:05:17,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 09:05:16" (2/3) ... [2018-01-31 09:05:17,223 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5671269a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 09:05:17, skipping insertion in model container [2018-01-31 09:05:17,223 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 09:05:17" (3/3) ... [2018-01-31 09:05:17,225 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2018-01-31 09:05:17,234 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 09:05:17,243 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-01-31 09:05:17,295 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 09:05:17,295 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 09:05:17,295 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 09:05:17,296 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 09:05:17,296 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 09:05:17,296 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 09:05:17,296 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 09:05:17,296 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 09:05:17,297 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 09:05:17,320 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states. [2018-01-31 09:05:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:05:17,327 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:17,328 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:17,328 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:17,333 INFO L82 PathProgramCache]: Analyzing trace with hash 163828531, now seen corresponding path program 1 times [2018-01-31 09:05:17,335 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:17,336 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:17,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:17,392 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:17,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:17,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:17,475 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:17,712 WARN L146 SmtUtils]: Spent 101ms on a formula simplification. DAG size of input: 7 DAG size of output 5 [2018-01-31 09:05:17,869 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-31 09:05:17,873 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:17,873 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:05:17,874 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:05:17,884 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:05:17,884 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:05:17,886 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 5 states. [2018-01-31 09:05:18,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:18,391 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-01-31 09:05:18,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:05:18,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-01-31 09:05:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:18,403 INFO L225 Difference]: With dead ends: 72 [2018-01-31 09:05:18,403 INFO L226 Difference]: Without dead ends: 63 [2018-01-31 09:05:18,406 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:05:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-01-31 09:05:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-01-31 09:05:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-01-31 09:05:18,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-01-31 09:05:18,438 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 11 [2018-01-31 09:05:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:18,439 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-01-31 09:05:18,439 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:05:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-01-31 09:05:18,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-01-31 09:05:18,440 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:18,440 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:18,440 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:18,440 INFO L82 PathProgramCache]: Analyzing trace with hash 163828532, now seen corresponding path program 1 times [2018-01-31 09:05:18,440 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:18,441 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:18,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:18,442 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:18,442 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:18,463 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:18,655 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-31 09:05:18,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:18,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:05:18,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:05:18,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:05:18,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:05:18,658 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 6 states. [2018-01-31 09:05:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:19,044 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-01-31 09:05:19,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 09:05:19,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-01-31 09:05:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:19,046 INFO L225 Difference]: With dead ends: 63 [2018-01-31 09:05:19,046 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 09:05:19,047 INFO L554 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-31 09:05:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 09:05:19,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-31 09:05:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-31 09:05:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-01-31 09:05:19,055 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 11 [2018-01-31 09:05:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:19,055 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-01-31 09:05:19,055 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:05:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-01-31 09:05:19,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:05:19,056 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:19,056 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:19,056 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:19,058 INFO L82 PathProgramCache]: Analyzing trace with hash 275072951, now seen corresponding path program 1 times [2018-01-31 09:05:19,058 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:19,058 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:19,059 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:19,060 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:19,060 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:19,096 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:19,188 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-31 09:05:19,188 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:19,188 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 09:05:19,189 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 09:05:19,189 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 09:05:19,189 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 09:05:19,189 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 5 states. [2018-01-31 09:05:19,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:19,688 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-01-31 09:05:19,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:05:19,689 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-31 09:05:19,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:19,690 INFO L225 Difference]: With dead ends: 57 [2018-01-31 09:05:19,690 INFO L226 Difference]: Without dead ends: 56 [2018-01-31 09:05:19,691 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-31 09:05:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-31 09:05:19,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-31 09:05:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 09:05:19,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-01-31 09:05:19,697 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 15 [2018-01-31 09:05:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:19,698 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-01-31 09:05:19,698 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 09:05:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-01-31 09:05:19,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 09:05:19,699 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:19,699 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:19,699 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:19,699 INFO L82 PathProgramCache]: Analyzing trace with hash 275072952, now seen corresponding path program 1 times [2018-01-31 09:05:19,700 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:19,700 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:19,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:19,701 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:19,701 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:19,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:19,739 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:19,897 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-31 09:05:19,897 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:19,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 09:05:19,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 09:05:19,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 09:05:19,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 09:05:19,898 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 6 states. [2018-01-31 09:05:20,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:20,096 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-01-31 09:05:20,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 09:05:20,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-31 09:05:20,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:20,097 INFO L225 Difference]: With dead ends: 56 [2018-01-31 09:05:20,097 INFO L226 Difference]: Without dead ends: 55 [2018-01-31 09:05:20,098 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-31 09:05:20,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-31 09:05:20,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-31 09:05:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-31 09:05:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-01-31 09:05:20,105 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 15 [2018-01-31 09:05:20,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:20,105 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-01-31 09:05:20,105 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 09:05:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-01-31 09:05:20,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:05:20,106 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:20,106 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:20,107 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:20,107 INFO L82 PathProgramCache]: Analyzing trace with hash -99332387, now seen corresponding path program 1 times [2018-01-31 09:05:20,107 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:20,107 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:20,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:20,108 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:20,108 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:20,137 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:20,366 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-31 09:05:20,366 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:20,366 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:05:20,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:05:20,367 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:05:20,367 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:05:20,367 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 12 states. [2018-01-31 09:05:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:20,772 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-01-31 09:05:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:05:20,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-01-31 09:05:20,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:20,774 INFO L225 Difference]: With dead ends: 55 [2018-01-31 09:05:20,774 INFO L226 Difference]: Without dead ends: 54 [2018-01-31 09:05:20,774 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:05:20,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-31 09:05:20,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-31 09:05:20,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-31 09:05:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-01-31 09:05:20,780 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 18 [2018-01-31 09:05:20,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:20,781 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-01-31 09:05:20,781 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:05:20,781 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-01-31 09:05:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-01-31 09:05:20,782 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:20,782 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:20,782 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:20,782 INFO L82 PathProgramCache]: Analyzing trace with hash -99332386, now seen corresponding path program 1 times [2018-01-31 09:05:20,782 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:20,782 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:20,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:20,783 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:20,783 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:20,805 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:21,030 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-31 09:05:21,030 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:21,031 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-31 09:05:21,031 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-31 09:05:21,031 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-31 09:05:21,031 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-31 09:05:21,032 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 12 states. [2018-01-31 09:05:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:21,529 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-01-31 09:05:21,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 09:05:21,531 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2018-01-31 09:05:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:21,532 INFO L225 Difference]: With dead ends: 54 [2018-01-31 09:05:21,533 INFO L226 Difference]: Without dead ends: 53 [2018-01-31 09:05:21,533 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-31 09:05:21,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-01-31 09:05:21,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-01-31 09:05:21,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-01-31 09:05:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-01-31 09:05:21,538 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 18 [2018-01-31 09:05:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:21,539 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-01-31 09:05:21,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-31 09:05:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-01-31 09:05:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:05:21,540 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:21,540 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:21,540 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash -924296738, now seen corresponding path program 1 times [2018-01-31 09:05:21,541 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:21,541 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:21,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:21,542 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:21,542 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:21,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:21,572 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:22,227 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-31 09:05:22,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:22,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:22,228 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:22,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:22,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:22,228 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 18 states. [2018-01-31 09:05:23,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:23,037 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-01-31 09:05:23,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:05:23,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-31 09:05:23,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:23,041 INFO L225 Difference]: With dead ends: 59 [2018-01-31 09:05:23,041 INFO L226 Difference]: Without dead ends: 57 [2018-01-31 09:05:23,042 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-01-31 09:05:23,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-31 09:05:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2018-01-31 09:05:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-01-31 09:05:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-01-31 09:05:23,048 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 28 [2018-01-31 09:05:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:23,048 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-01-31 09:05:23,048 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:23,048 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-01-31 09:05:23,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-31 09:05:23,049 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:23,049 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:23,049 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:23,050 INFO L82 PathProgramCache]: Analyzing trace with hash -924296737, now seen corresponding path program 1 times [2018-01-31 09:05:23,050 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:23,050 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:23,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:23,051 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:23,051 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:23,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:23,077 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:23,586 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-31 09:05:23,587 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:23,587 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:23,587 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:23,587 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:23,588 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:23,588 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 18 states. [2018-01-31 09:05:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:24,303 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-01-31 09:05:24,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 09:05:24,303 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-31 09:05:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:24,304 INFO L225 Difference]: With dead ends: 57 [2018-01-31 09:05:24,304 INFO L226 Difference]: Without dead ends: 55 [2018-01-31 09:05:24,305 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2018-01-31 09:05:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-31 09:05:24,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 49. [2018-01-31 09:05:24,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-01-31 09:05:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-01-31 09:05:24,311 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 28 [2018-01-31 09:05:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:24,311 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-01-31 09:05:24,311 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-01-31 09:05:24,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 09:05:24,312 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:24,312 INFO L351 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] [2018-01-31 09:05:24,312 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:24,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1411572216, now seen corresponding path program 1 times [2018-01-31 09:05:24,313 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:24,313 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:24,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:24,314 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:24,314 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:24,353 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:24,579 WARN L146 SmtUtils]: Spent 123ms on a formula simplification. DAG size of input: 10 DAG size of output 9 [2018-01-31 09:05:24,935 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-31 09:05:24,935 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:24,935 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:24,936 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:24,936 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:24,936 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:24,936 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 18 states. [2018-01-31 09:05:25,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:25,943 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-01-31 09:05:25,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 09:05:25,944 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-31 09:05:25,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:25,945 INFO L225 Difference]: With dead ends: 55 [2018-01-31 09:05:25,945 INFO L226 Difference]: Without dead ends: 54 [2018-01-31 09:05:25,945 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-01-31 09:05:25,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-31 09:05:25,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2018-01-31 09:05:25,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-31 09:05:25,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-01-31 09:05:25,951 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 29 [2018-01-31 09:05:25,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:25,951 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-01-31 09:05:25,951 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:25,951 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-01-31 09:05:25,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 09:05:25,952 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:25,952 INFO L351 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] [2018-01-31 09:05:25,952 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:25,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1411572217, now seen corresponding path program 1 times [2018-01-31 09:05:25,953 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:25,953 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:25,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:25,954 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:25,954 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:25,976 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:26,249 WARN L146 SmtUtils]: Spent 160ms on a formula simplification. DAG size of input: 10 DAG size of output 9 [2018-01-31 09:05:26,524 WARN L146 SmtUtils]: Spent 131ms on a formula simplification. DAG size of input: 18 DAG size of output 16 [2018-01-31 09:05:26,901 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-31 09:05:26,901 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:26,902 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-31 09:05:26,902 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 09:05:26,902 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 09:05:26,902 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2018-01-31 09:05:26,902 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-01-31 09:05:27,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:27,973 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-01-31 09:05:27,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-31 09:05:27,973 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 29 [2018-01-31 09:05:27,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:27,974 INFO L225 Difference]: With dead ends: 54 [2018-01-31 09:05:27,974 INFO L226 Difference]: Without dead ends: 52 [2018-01-31 09:05:27,975 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=152, Invalid=1038, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 09:05:27,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-01-31 09:05:27,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2018-01-31 09:05:27,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-31 09:05:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-31 09:05:27,980 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 29 [2018-01-31 09:05:27,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:27,980 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-31 09:05:27,981 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 09:05:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-31 09:05:27,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 09:05:27,982 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:27,982 INFO L351 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, 1, 1] [2018-01-31 09:05:27,982 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:27,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1939280405, now seen corresponding path program 1 times [2018-01-31 09:05:27,982 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:27,983 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:27,983 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:27,983 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:27,984 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:28,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:28,008 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:28,535 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-31 09:05:28,536 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:28,536 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-31 09:05:28,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:05:28,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:05:28,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:05:28,537 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 22 states. [2018-01-31 09:05:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:30,333 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-01-31 09:05:30,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 09:05:30,333 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 34 [2018-01-31 09:05:30,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:30,334 INFO L225 Difference]: With dead ends: 52 [2018-01-31 09:05:30,334 INFO L226 Difference]: Without dead ends: 51 [2018-01-31 09:05:30,335 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2018-01-31 09:05:30,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-31 09:05:30,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2018-01-31 09:05:30,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-31 09:05:30,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-01-31 09:05:30,340 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 34 [2018-01-31 09:05:30,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:30,340 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-01-31 09:05:30,340 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:05:30,340 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-01-31 09:05:30,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-31 09:05:30,341 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:30,342 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:30,342 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:30,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1404465429, now seen corresponding path program 1 times [2018-01-31 09:05:30,346 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:30,346 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:30,347 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:30,347 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:30,348 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:30,379 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:31,094 WARN L146 SmtUtils]: Spent 335ms on a formula simplification. DAG size of input: 20 DAG size of output 10 [2018-01-31 09:05:31,365 WARN L146 SmtUtils]: Spent 185ms on a formula simplification. DAG size of input: 25 DAG size of output 19 [2018-01-31 09:05:32,053 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-31 09:05:32,053 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:32,053 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2018-01-31 09:05:32,054 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 09:05:32,054 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 09:05:32,054 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2018-01-31 09:05:32,054 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 22 states. [2018-01-31 09:05:32,563 WARN L146 SmtUtils]: Spent 109ms on a formula simplification. DAG size of input: 71 DAG size of output 66 [2018-01-31 09:05:33,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:33,523 INFO L93 Difference]: Finished difference Result 54 states and 53 transitions. [2018-01-31 09:05:33,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-31 09:05:33,524 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 40 [2018-01-31 09:05:33,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:33,525 INFO L225 Difference]: With dead ends: 54 [2018-01-31 09:05:33,525 INFO L226 Difference]: Without dead ends: 43 [2018-01-31 09:05:33,525 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=194, Invalid=1528, Unknown=0, NotChecked=0, Total=1722 [2018-01-31 09:05:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-01-31 09:05:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-01-31 09:05:33,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-31 09:05:33,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 42 transitions. [2018-01-31 09:05:33,529 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 42 transitions. Word has length 40 [2018-01-31 09:05:33,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:33,529 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 42 transitions. [2018-01-31 09:05:33,530 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 09:05:33,530 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 42 transitions. [2018-01-31 09:05:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-01-31 09:05:33,531 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 09:05:33,531 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 09:05:33,531 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-31 09:05:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1091334897, now seen corresponding path program 1 times [2018-01-31 09:05:33,531 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 09:05:33,531 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 09:05:33,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:33,532 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 09:05:33,532 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 09:05:33,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 09:05:33,574 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 09:05:34,171 WARN L146 SmtUtils]: Spent 103ms on a formula simplification. DAG size of input: 24 DAG size of output 14 [2018-01-31 09:05:34,454 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 47 DAG size of output 34 [2018-01-31 09:05:35,227 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-31 09:05:35,227 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 09:05:35,227 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2018-01-31 09:05:35,227 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 09:05:35,228 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 09:05:35,228 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=536, Unknown=0, NotChecked=0, Total=600 [2018-01-31 09:05:35,228 INFO L87 Difference]: Start difference. First operand 43 states and 42 transitions. Second operand 25 states. [2018-01-31 09:05:36,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 09:05:36,779 INFO L93 Difference]: Finished difference Result 43 states and 42 transitions. [2018-01-31 09:05:36,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-01-31 09:05:36,780 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-01-31 09:05:36,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 09:05:36,780 INFO L225 Difference]: With dead ends: 43 [2018-01-31 09:05:36,780 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 09:05:36,781 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=205, Invalid=1775, Unknown=0, NotChecked=0, Total=1980 [2018-01-31 09:05:36,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 09:05:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 09:05:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 09:05:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 09:05:36,781 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-01-31 09:05:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 09:05:36,782 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 09:05:36,782 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 09:05:36,782 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 09:05:36,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 09:05:36,786 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 09:05:37,720 WARN L146 SmtUtils]: Spent 896ms on a formula simplification. DAG size of input: 93 DAG size of output 66 [2018-01-31 09:05:37,908 WARN L146 SmtUtils]: Spent 186ms on a formula simplification. DAG size of input: 11 DAG size of output 8 [2018-01-31 09:05:38,350 WARN L146 SmtUtils]: Spent 440ms on a formula simplification. DAG size of input: 29 DAG size of output 25 [2018-01-31 09:05:38,437 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,437 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 644) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 644) the Hoare annotation is: true [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L395 ceAbstractionStarter]: At program point L1(lines 1 644) the Hoare annotation is: (= 0 (select |#valid| 0)) [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point alloc_dataEXIT(lines 623 629) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr8RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr9RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point L627(line 627) no Hoare annotation was computed. [2018-01-31 09:05:38,438 INFO L399 ceAbstractionStarter]: For program point L625''(line 625) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point L626(line 626) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr10RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point L625(line 625) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr3RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point L627'(line 627) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point L628''(line 628) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point L625'(line 625) no Hoare annotation was computed. [2018-01-31 09:05:38,439 INFO L399 ceAbstractionStarter]: For program point L628(line 628) no Hoare annotation was computed. [2018-01-31 09:05:38,440 INFO L395 ceAbstractionStarter]: At program point alloc_dataENTRY(lines 623 629) the Hoare annotation is: (or (and (= |#valid| |old(#valid)|) (= 8 (select |#length| |alloc_data_#in~pdata.base|))) (not (= 0 |alloc_data_#in~pdata.offset|)) (not (= (select |old(#valid)| |alloc_data_#in~pdata.base|) 1)) (not (= 0 (select |old(#valid)| 0))) (not (= 8 (select |old(#length)| |alloc_data_#in~pdata.base|)))) [2018-01-31 09:05:38,440 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr4RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,440 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr0RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,440 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr1RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,440 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr6RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,440 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr5RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,440 INFO L399 ceAbstractionStarter]: For program point L626'(line 626) no Hoare annotation was computed. [2018-01-31 09:05:38,440 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr7RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,441 INFO L399 ceAbstractionStarter]: For program point alloc_dataFINAL(lines 623 629) no Hoare annotation was computed. [2018-01-31 09:05:38,441 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr11RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,441 INFO L399 ceAbstractionStarter]: For program point alloc_dataErr2RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,441 INFO L399 ceAbstractionStarter]: For program point L628'(line 628) no Hoare annotation was computed. [2018-01-31 09:05:38,441 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,441 INFO L399 ceAbstractionStarter]: For program point L641(line 641) no Hoare annotation was computed. [2018-01-31 09:05:38,441 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L395 ceAbstractionStarter]: At program point L640(line 640) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (and (= 0 (select |#valid| 0)) (= 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-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point L640''(line 640) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 639 644) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point L642''(line 642) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point L640'(line 640) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point L643(line 643) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point L642(line 642) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 639 644) no Hoare annotation was computed. [2018-01-31 09:05:38,442 INFO L399 ceAbstractionStarter]: For program point L642'''(line 642) no Hoare annotation was computed. [2018-01-31 09:05:38,443 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,443 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 639 644) no Hoare annotation was computed. [2018-01-31 09:05:38,443 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 639 644) the Hoare annotation is: (or (not (= 0 (select |old(#valid)| 0))) (= |#valid| |old(#valid)|)) [2018-01-31 09:05:38,443 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,443 INFO L395 ceAbstractionStarter]: At program point L642'(line 642) the Hoare annotation is: (or (let ((.cse3 (+ |main_~#data~5.offset| 4)) (.cse4 (select |#memory_$Pointer$.base| |main_~#data~5.base|))) (let ((.cse2 (select |#memory_$Pointer$.offset| |main_~#data~5.base|)) (.cse0 (select .cse4 |main_~#data~5.offset|)) (.cse1 (select .cse4 .cse3))) (and (= 1 (select |#valid| |main_~#data~5.base|)) (= (store (store (store |#valid| .cse0 0) |main_~#data~5.base| 0) .cse1 0) |old(#valid)|) (not (= |main_~#data~5.base| |main_#t~mem10.base|)) (= 8 (select |#length| |main_~#data~5.base|)) (<= 4 (select |#length| .cse0)) (= 0 (select .cse2 |main_~#data~5.offset|)) (= 0 |main_~#data~5.offset|) (= 0 |main_#t~mem11.offset|) (= 0 (select .cse2 .cse3)) (= 1 (select |#valid| .cse1)) (= 8 (select (select |#memory_int| |main_#t~mem11.base|) 0)) (not (= .cse0 .cse1)) (= 4 (select (select |#memory_int| |main_#t~mem10.base|) |main_#t~mem10.offset|)) (= 0 |main_#t~mem10.offset|) (= |main_#t~mem10.base| .cse0) (= (store (store (store |#valid| |main_#t~mem10.base| 0) |main_~#data~5.base| 0) |main_#t~mem11.base| 0) |old(#valid)|) (= 4 (select |#length| .cse1)) (= 0 (select |#valid| 0)) (= 1 (select |#valid| |main_#t~mem10.base|))))) (not (= 0 (select |old(#valid)| 0)))) [2018-01-31 09:05:38,444 INFO L399 ceAbstractionStarter]: For program point free_dataErr1RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point free_dataErr6RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point L634(line 634) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point L633(line 633) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point L632(line 632) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point L634''(line 634) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point L634''''''(line 634) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point L634''''(line 634) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point free_dataErr2RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point L636(line 636) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point free_dataErr4RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,445 INFO L399 ceAbstractionStarter]: For program point free_dataErr7RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point L636'(line 636) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point free_dataErr0RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point L634'(line 634) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L395 ceAbstractionStarter]: At program point free_dataENTRY(lines 630 638) the Hoare annotation is: (or (not (= (select |old(#valid)| |free_data_#in~data.hi.base|) 1)) (< (select |#length| |free_data_#in~data.lo.base|) 4) (not (= 0 |free_data_#in~data.hi.offset|)) (= |free_data_#in~data.lo.base| |free_data_#in~data.hi.base|) (= |#valid| |old(#valid)|) (not (= 0 (select |old(#valid)| 0))) (not (= 0 |free_data_#in~data.lo.offset|)) (not (= 1 (select |old(#valid)| |free_data_#in~data.lo.base|))) (not (= (select |#length| |free_data_#in~data.hi.base|) 4))) [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point free_dataFINAL(lines 630 638) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point L634'''(line 634) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point free_dataErr5RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point free_dataErr3RequiresViolation(lines 1 644) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point L634'''''(line 634) no Hoare annotation was computed. [2018-01-31 09:05:38,446 INFO L399 ceAbstractionStarter]: For program point free_dataEXIT(lines 630 638) no Hoare annotation was computed. [2018-01-31 09:05:38,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 09:05:38 BoogieIcfgContainer [2018-01-31 09:05:38,450 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 09:05:38,451 INFO L168 Benchmark]: Toolchain (without parser) took 22200.06 ms. Allocated memory was 308.8 MB in the beginning and 632.3 MB in the end (delta: 323.5 MB). Free memory was 267.7 MB in the beginning and 317.0 MB in the end (delta: -49.3 MB). Peak memory consumption was 274.2 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:38,452 INFO L168 Benchmark]: CDTParser took 0.93 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 09:05:38,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.95 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 257.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:38,452 INFO L168 Benchmark]: Boogie Preprocessor took 42.00 ms. Allocated memory is still 308.8 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:38,452 INFO L168 Benchmark]: RCFGBuilder took 625.19 ms. Allocated memory is still 308.8 MB. Free memory was 255.7 MB in the beginning and 232.8 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:38,452 INFO L168 Benchmark]: TraceAbstraction took 21232.46 ms. Allocated memory was 308.8 MB in the beginning and 632.3 MB in the end (delta: 323.5 MB). Free memory was 232.8 MB in the beginning and 317.0 MB in the end (delta: -84.2 MB). Peak memory consumption was 239.3 MB. Max. memory is 5.3 GB. [2018-01-31 09:05:38,454 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.93 ms. Allocated memory is still 308.8 MB. Free memory is still 273.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 271.95 ms. Allocated memory is still 308.8 MB. Free memory was 267.7 MB in the beginning and 257.7 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 42.00 ms. Allocated memory is still 308.8 MB. Free memory was 257.7 MB in the beginning and 255.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 625.19 ms. Allocated memory is still 308.8 MB. Free memory was 255.7 MB in the beginning and 232.8 MB in the end (delta: 22.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 21232.46 ms. Allocated memory was 308.8 MB in the beginning and 632.3 MB in the end (delta: 323.5 MB). Free memory was 232.8 MB in the beginning and 317.0 MB in the end (delta: -84.2 MB). Peak memory consumption was 239.3 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: 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: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed 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]: free always succeeds For all program executions holds that free 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]: 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]: pointer dereference always succeeds For all program executions holds that pointer dereference 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 25 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 72 locations, 25 error locations. SAFE Result, 21.1s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 10.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 434 SDtfs, 709 SDslu, 2862 SDs, 0 SdLazy, 3458 SolverSat, 246 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 318 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 298 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1241 ImplicationChecksByTransitivity, 12.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred 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, 13 MinimizatonAttempts, 30 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 8 NumberOfFragments, 285 HoareAnnotationTreeSize, 8 FomulaSimplifications, 44 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 155 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 318 NumberOfCodeBlocks, 318 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 305 ConstructedInterpolants, 0 QuantifiedInterpolants, 167982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_09-05-38-475.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_09-05-38-475.csv Received shutdown request...