java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:16:55,863 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:16:55,866 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:16:55,888 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:16:55,889 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:16:55,891 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:16:55,892 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:16:55,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:16:55,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:16:55,910 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:16:55,911 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:16:55,912 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:16:55,913 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:16:55,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:16:55,916 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:16:55,919 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:16:55,930 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:16:55,932 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:16:55,941 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:16:55,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:16:55,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:16:55,954 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:16:55,954 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:16:55,955 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:16:55,960 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:16:55,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:16:55,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:16:55,963 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:16:55,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:16:55,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:16:55,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:16:55,967 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 03:16:55,986 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:16:55,986 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:16:55,987 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:16:55,987 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:16:55,988 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:16:55,988 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:16:55,989 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:16:55,989 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:16:55,989 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:16:55,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:16:55,990 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:16:55,990 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:16:55,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:16:55,991 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:16:55,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:16:55,991 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:16:55,991 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:16:55,991 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:16:55,991 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:16:55,992 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:16:55,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:16:55,994 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:16:55,994 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:16:55,994 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:16:55,994 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:16:55,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:16:55,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:16:55,995 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:16:55,995 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:16:55,995 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:16:55,995 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:16:55,996 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:16:55,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:16:55,996 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:16:55,996 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:16:55,997 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:16:55,998 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:16:56,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:16:56,076 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:16:56,084 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:16:56,085 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:16:56,086 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:16:56,087 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_false-valid-memtrack_true-termination.i [2018-01-25 03:16:56,412 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:16:56,419 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:16:56,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:16:56,420 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:16:56,427 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:16:56,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f4d08b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56, skipping insertion in model container [2018-01-25 03:16:56,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,451 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:16:56,491 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:16:56,610 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:16:56,628 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:16:56,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56 WrapperNode [2018-01-25 03:16:56,638 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:16:56,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:16:56,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:16:56,639 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:16:56,657 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,673 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,675 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,677 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... [2018-01-25 03:16:56,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:16:56,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:16:56,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:16:56,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:16:56,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:16:56,733 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:16:56,733 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:16:56,733 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-01-25 03:16:56,733 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-01-25 03:16:56,733 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:16:56,733 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:16:56,733 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-01-25 03:16:56,734 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:16:56,735 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:16:56,735 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:16:57,036 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:16:57,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:16:57 BoogieIcfgContainer [2018-01-25 03:16:57,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:16:57,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:16:57,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:16:57,040 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:16:57,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:16:56" (1/3) ... [2018-01-25 03:16:57,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cb6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:16:57, skipping insertion in model container [2018-01-25 03:16:57,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:16:56" (2/3) ... [2018-01-25 03:16:57,041 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76cb6b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:16:57, skipping insertion in model container [2018-01-25 03:16:57,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:16:57" (3/3) ... [2018-01-25 03:16:57,043 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0019_1_false-valid-memtrack_true-termination.i [2018-01-25 03:16:57,049 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:16:57,056 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2018-01-25 03:16:57,096 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:16:57,097 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:16:57,097 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:16:57,097 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:16:57,097 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:16:57,097 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:16:57,097 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:16:57,097 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:16:57,098 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:16:57,116 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2018-01-25 03:16:57,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:16:57,123 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:57,124 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:57,124 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:16:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130535, now seen corresponding path program 1 times [2018-01-25 03:16:57,130 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:57,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:57,171 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:57,171 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:57,171 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:57,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:57,227 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:57,363 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:57,363 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:16:57,363 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:57,366 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:16:57,379 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:16:57,380 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:16:57,383 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 5 states. [2018-01-25 03:16:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:57,749 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-01-25 03:16:57,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:16:57,751 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-01-25 03:16:57,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:57,763 INFO L225 Difference]: With dead ends: 71 [2018-01-25 03:16:57,763 INFO L226 Difference]: Without dead ends: 64 [2018-01-25 03:16:57,767 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:16:57,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-25 03:16:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2018-01-25 03:16:57,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-01-25 03:16:57,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-01-25 03:16:57,815 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 10 [2018-01-25 03:16:57,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:57,815 INFO L432 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-01-25 03:16:57,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:16:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-01-25 03:16:57,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-01-25 03:16:57,816 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:57,817 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:57,817 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:16:57,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1278130536, now seen corresponding path program 1 times [2018-01-25 03:16:57,817 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:57,818 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:57,818 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:57,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:57,819 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:57,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:57,840 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:58,082 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:58,083 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:16:58,083 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:58,085 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:16:58,085 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:16:58,085 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:16:58,086 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 6 states. [2018-01-25 03:16:58,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:58,418 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-01-25 03:16:58,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:16:58,419 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-01-25 03:16:58,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:58,420 INFO L225 Difference]: With dead ends: 64 [2018-01-25 03:16:58,420 INFO L226 Difference]: Without dead ends: 60 [2018-01-25 03:16:58,421 INFO L525 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-25 03:16:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-25 03:16:58,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-01-25 03:16:58,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 03:16:58,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-01-25 03:16:58,430 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 10 [2018-01-25 03:16:58,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:58,431 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-01-25 03:16:58,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:16:58,431 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-01-25 03:16:58,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:16:58,432 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:58,432 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:58,433 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:16:58,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947157, now seen corresponding path program 1 times [2018-01-25 03:16:58,434 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:58,435 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:58,436 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:58,436 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:58,436 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:58,492 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:58,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:58,650 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:58,650 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:16:58,651 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:58,651 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:16:58,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:16:58,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:16:58,652 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 5 states. [2018-01-25 03:16:58,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:58,779 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-01-25 03:16:58,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:16:58,780 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:16:58,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:58,781 INFO L225 Difference]: With dead ends: 60 [2018-01-25 03:16:58,781 INFO L226 Difference]: Without dead ends: 59 [2018-01-25 03:16:58,781 INFO L525 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-25 03:16:58,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-25 03:16:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-25 03:16:58,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-25 03:16:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-01-25 03:16:58,793 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 14 [2018-01-25 03:16:58,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:58,793 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-01-25 03:16:58,794 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:16:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-01-25 03:16:58,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:16:58,794 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:58,795 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:58,795 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:16:58,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1177947156, now seen corresponding path program 1 times [2018-01-25 03:16:58,795 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:58,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:58,798 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:58,798 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:58,798 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:58,865 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:59,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:59,071 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:59,071 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:16:59,071 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:59,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:16:59,072 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:16:59,072 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:16:59,073 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 6 states. [2018-01-25 03:16:59,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:16:59,337 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-01-25 03:16:59,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:16:59,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-01-25 03:16:59,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:16:59,344 INFO L225 Difference]: With dead ends: 59 [2018-01-25 03:16:59,344 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 03:16:59,344 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:16:59,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 03:16:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-25 03:16:59,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-25 03:16:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-01-25 03:16:59,351 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 14 [2018-01-25 03:16:59,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:16:59,351 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-01-25 03:16:59,351 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:16:59,351 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-01-25 03:16:59,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:16:59,352 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:16:59,352 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:16:59,352 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:16:59,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006569, now seen corresponding path program 1 times [2018-01-25 03:16:59,353 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:16:59,354 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:59,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:16:59,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:16:59,355 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:16:59,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:16:59,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:16:59,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:16:59,654 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:16:59,654 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:16:59,654 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:16:59,655 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:16:59,655 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:16:59,655 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:16:59,656 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 12 states. [2018-01-25 03:17:00,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:00,083 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-01-25 03:17:00,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:17:00,083 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-25 03:17:00,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:00,084 INFO L225 Difference]: With dead ends: 58 [2018-01-25 03:17:00,084 INFO L226 Difference]: Without dead ends: 57 [2018-01-25 03:17:00,085 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:17:00,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-01-25 03:17:00,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-01-25 03:17:00,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-25 03:17:00,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-01-25 03:17:00,090 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 17 [2018-01-25 03:17:00,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:00,090 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-01-25 03:17:00,090 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:17:00,090 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-01-25 03:17:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-01-25 03:17:00,091 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:00,091 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:00,091 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:00,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1954006570, now seen corresponding path program 1 times [2018-01-25 03:17:00,091 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:00,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:00,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:00,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:00,092 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:00,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:00,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:00,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:00,293 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:00,293 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-01-25 03:17:00,293 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:00,293 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-01-25 03:17:00,293 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-01-25 03:17:00,294 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-01-25 03:17:00,294 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 12 states. [2018-01-25 03:17:00,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:00,678 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-01-25 03:17:00,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-25 03:17:00,679 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-01-25 03:17:00,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:00,680 INFO L225 Difference]: With dead ends: 57 [2018-01-25 03:17:00,680 INFO L226 Difference]: Without dead ends: 56 [2018-01-25 03:17:00,680 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-01-25 03:17:00,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-01-25 03:17:00,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-01-25 03:17:00,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-25 03:17:00,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-01-25 03:17:00,686 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 17 [2018-01-25 03:17:00,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:00,686 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-01-25 03:17:00,686 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-01-25 03:17:00,686 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-01-25 03:17:00,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:17:00,687 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:00,687 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:00,687 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:00,688 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658956, now seen corresponding path program 1 times [2018-01-25 03:17:00,688 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:00,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:00,689 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:00,689 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:00,689 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:00,705 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:00,795 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:00,795 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:17:00,795 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:00,796 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:17:00,796 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:17:00,796 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:17:00,797 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 8 states. [2018-01-25 03:17:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:00,980 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-01-25 03:17:00,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:17:00,981 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2018-01-25 03:17:00,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:00,982 INFO L225 Difference]: With dead ends: 65 [2018-01-25 03:17:00,982 INFO L226 Difference]: Without dead ends: 61 [2018-01-25 03:17:00,982 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:17:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-25 03:17:00,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-01-25 03:17:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-25 03:17:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-01-25 03:17:00,988 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 23 [2018-01-25 03:17:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:00,989 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-01-25 03:17:00,989 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:17:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-01-25 03:17:00,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:17:00,990 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:00,990 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:00,990 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:00,990 INFO L82 PathProgramCache]: Analyzing trace with hash 2079658957, now seen corresponding path program 1 times [2018-01-25 03:17:00,990 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:00,991 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:00,991 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:00,992 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:00,992 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:01,006 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:01,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:01,137 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:01,137 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-25 03:17:01,138 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:01,138 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-25 03:17:01,138 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-25 03:17:01,138 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-01-25 03:17:01,139 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 9 states. [2018-01-25 03:17:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:01,346 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2018-01-25 03:17:01,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:17:01,347 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2018-01-25 03:17:01,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:01,347 INFO L225 Difference]: With dead ends: 54 [2018-01-25 03:17:01,348 INFO L226 Difference]: Without dead ends: 50 [2018-01-25 03:17:01,348 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:17:01,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-01-25 03:17:01,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-01-25 03:17:01,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 03:17:01,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-01-25 03:17:01,353 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 23 [2018-01-25 03:17:01,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:01,353 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-01-25 03:17:01,353 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-25 03:17:01,353 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-01-25 03:17:01,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:17:01,354 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:01,354 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:01,354 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:01,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479601, now seen corresponding path program 1 times [2018-01-25 03:17:01,354 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:01,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:01,355 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:01,355 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:01,355 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:01,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:01,377 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:02,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:02,049 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:02,050 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 03:17:02,050 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:02,050 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 03:17:02,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 03:17:02,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:17:02,051 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 18 states. [2018-01-25 03:17:02,628 WARN L146 SmtUtils]: Spent 175ms on a formula simplification. DAG size of input: 45 DAG size of output 37 [2018-01-25 03:17:03,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:03,084 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-01-25 03:17:03,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 03:17:03,084 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-25 03:17:03,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:03,088 INFO L225 Difference]: With dead ends: 53 [2018-01-25 03:17:03,088 INFO L226 Difference]: Without dead ends: 51 [2018-01-25 03:17:03,089 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=120, Invalid=810, Unknown=0, NotChecked=0, Total=930 [2018-01-25 03:17:03,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-01-25 03:17:03,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-01-25 03:17:03,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-01-25 03:17:03,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-01-25 03:17:03,093 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 27 [2018-01-25 03:17:03,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:03,093 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-01-25 03:17:03,093 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 03:17:03,093 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-01-25 03:17:03,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-01-25 03:17:03,094 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:03,094 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:03,094 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:03,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1871479602, now seen corresponding path program 1 times [2018-01-25 03:17:03,094 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:03,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:03,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:03,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:03,095 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:03,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:03,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:03,863 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:03,863 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 03:17:03,863 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:03,864 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 03:17:03,864 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 03:17:03,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:17:03,864 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 18 states. [2018-01-25 03:17:04,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:04,442 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-01-25 03:17:04,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-25 03:17:04,442 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 27 [2018-01-25 03:17:04,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:04,443 INFO L225 Difference]: With dead ends: 51 [2018-01-25 03:17:04,443 INFO L226 Difference]: Without dead ends: 49 [2018-01-25 03:17:04,443 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=114, Invalid=756, Unknown=0, NotChecked=0, Total=870 [2018-01-25 03:17:04,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-01-25 03:17:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-01-25 03:17:04,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-25 03:17:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-01-25 03:17:04,448 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 27 [2018-01-25 03:17:04,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:04,448 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-01-25 03:17:04,448 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 03:17:04,448 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-01-25 03:17:04,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:17:04,449 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:04,449 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:04,449 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674501, now seen corresponding path program 1 times [2018-01-25 03:17:04,450 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:04,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:04,450 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:04,450 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:04,450 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:04,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:04,469 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:04,888 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:04,888 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 03:17:04,888 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:04,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 03:17:04,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 03:17:04,889 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:17:04,889 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 18 states. [2018-01-25 03:17:05,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:05,622 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-01-25 03:17:05,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-25 03:17:05,622 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-25 03:17:05,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:05,623 INFO L225 Difference]: With dead ends: 49 [2018-01-25 03:17:05,623 INFO L226 Difference]: Without dead ends: 48 [2018-01-25 03:17:05,624 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=141, Invalid=851, Unknown=0, NotChecked=0, Total=992 [2018-01-25 03:17:05,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-01-25 03:17:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-01-25 03:17:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-01-25 03:17:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-01-25 03:17:05,628 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 28 [2018-01-25 03:17:05,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:05,629 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-01-25 03:17:05,629 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 03:17:05,629 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-01-25 03:17:05,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-25 03:17:05,630 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:05,630 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:05,630 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:05,631 INFO L82 PathProgramCache]: Analyzing trace with hash 2113674502, now seen corresponding path program 1 times [2018-01-25 03:17:05,631 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:05,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:05,632 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:05,632 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:05,632 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:05,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:05,650 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:06,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:06,076 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:06,076 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-01-25 03:17:06,076 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:06,077 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-25 03:17:06,077 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-25 03:17:06,077 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:17:06,077 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 18 states. [2018-01-25 03:17:07,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:07,783 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-01-25 03:17:07,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-01-25 03:17:07,783 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 28 [2018-01-25 03:17:07,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:07,784 INFO L225 Difference]: With dead ends: 48 [2018-01-25 03:17:07,784 INFO L226 Difference]: Without dead ends: 46 [2018-01-25 03:17:07,784 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2018-01-25 03:17:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-25 03:17:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-01-25 03:17:07,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-01-25 03:17:07,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-01-25 03:17:07,787 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 28 [2018-01-25 03:17:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:07,788 INFO L432 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-01-25 03:17:07,788 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-25 03:17:07,788 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-01-25 03:17:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:17:07,788 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:07,788 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:07,788 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, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:07,789 INFO L82 PathProgramCache]: Analyzing trace with hash -38443497, now seen corresponding path program 1 times [2018-01-25 03:17:07,789 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:07,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:07,789 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:07,789 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:07,790 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:07,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:07,807 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:08,728 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:08,728 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-25 03:17:08,728 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:08,729 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 03:17:08,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 03:17:08,729 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=410, Unknown=0, NotChecked=0, Total=462 [2018-01-25 03:17:08,730 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-01-25 03:17:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:09,515 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-01-25 03:17:09,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 03:17:09,516 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 31 [2018-01-25 03:17:09,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:09,517 INFO L225 Difference]: With dead ends: 46 [2018-01-25 03:17:09,517 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 03:17:09,517 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 03:17:09,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 03:17:09,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-01-25 03:17:09,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-01-25 03:17:09,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-01-25 03:17:09,521 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 31 [2018-01-25 03:17:09,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:09,522 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-01-25 03:17:09,522 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 03:17:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-01-25 03:17:09,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-25 03:17:09,523 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:09,523 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:09,523 INFO L371 AbstractCegarLoop]: === Iteration 14 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:09,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1191748404, now seen corresponding path program 1 times [2018-01-25 03:17:09,524 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:09,524 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:09,525 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:09,525 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:09,525 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:17:09,543 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:17:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:17:10,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:17:10,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-01-25 03:17:10,112 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:17:10,113 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-25 03:17:10,113 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-25 03:17:10,113 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2018-01-25 03:17:10,113 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 22 states. [2018-01-25 03:17:11,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:17:11,165 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-01-25 03:17:11,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-25 03:17:11,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 32 [2018-01-25 03:17:11,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:17:11,166 INFO L225 Difference]: With dead ends: 45 [2018-01-25 03:17:11,166 INFO L226 Difference]: Without dead ends: 44 [2018-01-25 03:17:11,167 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=193, Invalid=1289, Unknown=0, NotChecked=0, Total=1482 [2018-01-25 03:17:11,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-01-25 03:17:11,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-01-25 03:17:11,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-01-25 03:17:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-01-25 03:17:11,170 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 32 [2018-01-25 03:17:11,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:17:11,170 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-01-25 03:17:11,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-25 03:17:11,170 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-01-25 03:17:11,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-25 03:17:11,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:17:11,171 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:17:11,171 INFO L371 AbstractCegarLoop]: === Iteration 15 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr0EnsuresViolation, free_dataErr1RequiresViolation, free_dataErr10RequiresViolation, free_dataErr9RequiresViolation, free_dataErr11RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr14RequiresViolation, free_dataErr3RequiresViolation, free_dataErr7RequiresViolation, free_dataErr12RequiresViolation, free_dataErr2RequiresViolation, free_dataErr8RequiresViolation, free_dataErr13RequiresViolation, free_dataErr0RequiresViolation, free_dataErr15RequiresViolation, free_dataErr5RequiresViolation]=== [2018-01-25 03:17:11,171 INFO L82 PathProgramCache]: Analyzing trace with hash -718496508, now seen corresponding path program 1 times [2018-01-25 03:17:11,171 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:17:11,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:11,172 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:17:11,172 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:17:11,172 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:17:11,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 03:17:11,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-01-25 03:17:11,245 INFO L381 BasicCegarLoop]: Counterexample might be feasible [2018-01-25 03:17:11,266 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-01-25 03:17:11,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 03:17:11 BoogieIcfgContainer [2018-01-25 03:17:11,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 03:17:11,289 INFO L168 Benchmark]: Toolchain (without parser) took 14876.40 ms. Allocated memory was 308.3 MB in the beginning and 596.1 MB in the end (delta: 287.8 MB). Free memory was 266.6 MB in the beginning and 355.3 MB in the end (delta: -88.7 MB). Peak memory consumption was 199.1 MB. Max. memory is 5.3 GB. [2018-01-25 03:17:11,290 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 03:17:11,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 218.35 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:17:11,291 INFO L168 Benchmark]: Boogie Preprocessor took 40.35 ms. Allocated memory is still 308.3 MB. Free memory was 255.6 MB in the beginning and 253.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 03:17:11,291 INFO L168 Benchmark]: RCFGBuilder took 357.77 ms. Allocated memory is still 308.3 MB. Free memory was 253.6 MB in the beginning and 232.0 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-25 03:17:11,292 INFO L168 Benchmark]: TraceAbstraction took 14250.02 ms. Allocated memory was 308.3 MB in the beginning and 596.1 MB in the end (delta: 287.8 MB). Free memory was 231.0 MB in the beginning and 355.3 MB in the end (delta: -124.3 MB). Peak memory consumption was 163.5 MB. Max. memory is 5.3 GB. [2018-01-25 03:17:11,294 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.24 ms. Allocated memory is still 308.3 MB. Free memory is still 272.6 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 218.35 ms. Allocated memory is still 308.3 MB. Free memory was 265.6 MB in the beginning and 255.6 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 40.35 ms. Allocated memory is still 308.3 MB. Free memory was 255.6 MB in the beginning and 253.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 357.77 ms. Allocated memory is still 308.3 MB. Free memory was 253.6 MB in the beginning and 232.0 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 14250.02 ms. Allocated memory was 308.3 MB in the beginning and 596.1 MB in the end (delta: 287.8 MB). Free memory was 231.0 MB in the beginning and 355.3 MB in the end (delta: -124.3 MB). Peak memory consumption was 163.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 641]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 641. Possible FailurePath: [L642] FCALL TData data; VAL [data={17:0}] [L643] CALL alloc_data(&data) VAL [pdata={17:0}] [L625] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L625] FCALL pdata->lo = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, pdata={17:0}, pdata={17:0}] [L626] EXPR, FCALL malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}] [L626] FCALL pdata->hi = (int *)malloc(sizeof(int)) VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}] [L627] EXPR, FCALL pdata->lo VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L627] FCALL *(pdata->lo) = 4 VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->lo={12:0}] [L628] EXPR, FCALL pdata->hi VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L628] RET, FCALL *(pdata->hi) = 8 VAL [malloc(sizeof(int))={12:0}, malloc(sizeof(int))={14:0}, pdata={17:0}, pdata={17:0}, pdata->hi={14:0}] [L643] alloc_data(&data) VAL [data={17:0}] [L644] CALL free_data(&data) VAL [data={17:0}] [L632] EXPR, FCALL data->lo VAL [data={17:0}, data={17:0}, data->lo={12:0}] [L632] int *lo = data->lo; [L633] EXPR, FCALL data->hi VAL [data={17:0}, data={17:0}, data->hi={14:0}, lo={12:0}] [L633] int *hi = data->hi; [L634] EXPR, FCALL \read(*lo) VAL [\read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] EXPR, FCALL \read(*hi) VAL [\read(*hi)=8, \read(*lo)=4, data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L634] COND FALSE !(*lo >= *hi) [L638] FCALL data->lo = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L639] RET, FCALL data->hi = ((void *)0) VAL [data={17:0}, data={17:0}, hi={14:0}, lo={12:0}] [L644] free_data(&data) VAL [data={17:0}] [L645] return 0; VAL [\result=0, data={17:0}] [L645] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 71 locations, 29 error locations. UNSAFE Result, 14.1s OverallTime, 15 OverallIterations, 1 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 462 SDtfs, 590 SDslu, 2203 SDs, 0 SdLazy, 3625 SolverSat, 265 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 284 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 842 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 26 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 338 NumberOfCodeBlocks, 338 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 287 ConstructedInterpolants, 0 QuantifiedInterpolants, 100406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_03-17-11-302.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_false-valid-memtrack_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_03-17-11-302.csv Received shutdown request...