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/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:13:55,123 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:13:55,125 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:13:55,141 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:13:55,141 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:13:55,142 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:13:55,144 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:13:55,146 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:13:55,149 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:13:55,150 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:13:55,153 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:13:55,153 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:13:55,154 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:13:55,156 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:13:55,159 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:13:55,162 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:13:55,165 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:13:55,167 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:13:55,168 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:13:55,170 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:13:55,173 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:13:55,173 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:13:55,173 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:13:55,175 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:13:55,176 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:13:55,177 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:13:55,178 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:13:55,179 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:13:55,179 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:13:55,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:13:55,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:13:55,185 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:13:55,214 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:13:55,214 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:13:55,215 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:13:55,215 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:13:55,216 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:13:55,216 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:13:55,216 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:13:55,216 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:13:55,216 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:13:55,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:13:55,217 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:13:55,217 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:13:55,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:13:55,218 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:13:55,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:13:55,218 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:13:55,218 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:13:55,218 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:13:55,219 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:13:55,219 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:13:55,225 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:13:55,225 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:13:55,226 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:13:55,226 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:13:55,226 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:13:55,226 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:13:55,226 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:13:55,227 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:13:55,227 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:13:55,227 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:13:55,227 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:13:55,227 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:13:55,227 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:13:55,228 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:13:55,228 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:13:55,229 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:13:55,237 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:13:55,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:13:55,381 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:13:55,385 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:13:55,397 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:13:55,397 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:13:55,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-01-25 03:13:55,735 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:13:55,742 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:13:55,743 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:13:55,744 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:13:55,752 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:13:55,753 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:13:55" (1/1) ... [2018-01-25 03:13:55,758 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28ea857c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:55, skipping insertion in model container [2018-01-25 03:13:55,758 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:13:55" (1/1) ... [2018-01-25 03:13:55,779 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:13:55,835 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:13:56,099 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:13:56,155 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:13:56,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56 WrapperNode [2018-01-25 03:13:56,175 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:13:56,176 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:13:56,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:13:56,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:13:56,198 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (1/1) ... [2018-01-25 03:13:56,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (1/1) ... [2018-01-25 03:13:56,215 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (1/1) ... [2018-01-25 03:13:56,216 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (1/1) ... [2018-01-25 03:13:56,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (1/1) ... [2018-01-25 03:13:56,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (1/1) ... [2018-01-25 03:13:56,249 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (1/1) ... [2018-01-25 03:13:56,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:13:56,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:13:56,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:13:56,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:13:56,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13: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:13:56,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:13:56,395 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:13:56,400 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-25 03:13:56,400 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-25 03:13:56,401 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 03:13:56,401 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:13:56,401 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:13:56,401 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:13:56,401 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:13:56,401 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:13:56,402 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:13:56,402 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:13:56,402 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:13:56,402 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:13:56,402 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:13:56,402 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:13:56,402 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-25 03:13:56,403 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-25 03:13:56,403 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 03:13:56,403 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:13:56,403 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:13:56,403 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:13:57,679 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:13:57,680 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:13:57 BoogieIcfgContainer [2018-01-25 03:13:57,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:13:57,681 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:13:57,682 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:13:57,684 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:13:57,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:13:55" (1/3) ... [2018-01-25 03:13:57,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467f03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:13:57, skipping insertion in model container [2018-01-25 03:13:57,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:13:56" (2/3) ... [2018-01-25 03:13:57,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@467f03b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:13:57, skipping insertion in model container [2018-01-25 03:13:57,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:13:57" (3/3) ... [2018-01-25 03:13:57,690 INFO L105 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-01-25 03:13:57,700 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:13:57,708 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-25 03:13:57,775 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:13:57,776 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:13:57,776 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:13:57,776 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:13:57,776 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:13:57,776 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:13:57,777 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:13:57,777 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:13:57,778 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:13:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-01-25 03:13:57,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:13:57,817 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:13:57,818 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:13:57,818 INFO L371 AbstractCegarLoop]: === Iteration 1 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:13:57,823 INFO L82 PathProgramCache]: Analyzing trace with hash -548983798, now seen corresponding path program 1 times [2018-01-25 03:13:57,825 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:13:57,888 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:57,889 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:13:57,889 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:57,889 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:13:57,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:13:57,955 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:13:58,045 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:13:58,048 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:13:58,048 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:13:58,048 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:13:58,052 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:13:58,068 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:13:58,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:13:58,072 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2018-01-25 03:13:58,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:13:58,349 INFO L93 Difference]: Finished difference Result 235 states and 262 transitions. [2018-01-25 03:13:58,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:13:58,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:13:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:13:58,363 INFO L225 Difference]: With dead ends: 235 [2018-01-25 03:13:58,364 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 03:13:58,369 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:13:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 03:13:58,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-01-25 03:13:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 03:13:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-01-25 03:13:58,421 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2018-01-25 03:13:58,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:13:58,422 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-01-25 03:13:58,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:13:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-01-25 03:13:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:13:58,423 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:13:58,423 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:13:58,423 INFO L371 AbstractCegarLoop]: === Iteration 2 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:13:58,423 INFO L82 PathProgramCache]: Analyzing trace with hash -548983797, now seen corresponding path program 1 times [2018-01-25 03:13:58,424 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:13:58,424 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:58,425 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:13:58,425 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:58,425 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:13:58,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:13:58,443 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:13:58,510 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:13:58,510 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:13:58,511 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:13:58,511 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:13:58,512 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:13:58,513 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:13:58,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:13:58,513 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 3 states. [2018-01-25 03:13:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:13:58,640 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-01-25 03:13:58,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:13:58,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:13:58,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:13:58,642 INFO L225 Difference]: With dead ends: 119 [2018-01-25 03:13:58,642 INFO L226 Difference]: Without dead ends: 118 [2018-01-25 03:13:58,643 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:13:58,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-25 03:13:58,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-01-25 03:13:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-25 03:13:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-25 03:13:58,652 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2018-01-25 03:13:58,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:13:58,652 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-25 03:13:58,652 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:13:58,652 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-25 03:13:58,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:13:58,653 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:13:58,653 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:13:58,653 INFO L371 AbstractCegarLoop]: === Iteration 3 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:13:58,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977305, now seen corresponding path program 1 times [2018-01-25 03:13:58,653 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:13:58,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:58,654 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:13:58,654 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:58,654 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:13:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:13:58,674 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:13:58,761 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:13:58,761 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:13:58,761 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:13:58,761 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:13:58,762 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:13:58,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:13:58,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:13:58,762 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-01-25 03:13:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:13:59,171 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-01-25 03:13:59,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:13:59,171 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:13:59,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:13:59,177 INFO L225 Difference]: With dead ends: 130 [2018-01-25 03:13:59,177 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 03:13:59,178 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:13:59,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 03:13:59,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-01-25 03:13:59,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:13:59,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-25 03:13:59,206 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 14 [2018-01-25 03:13:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:13:59,217 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-25 03:13:59,218 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:13:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-25 03:13:59,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:13:59,219 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:13:59,219 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:13:59,219 INFO L371 AbstractCegarLoop]: === Iteration 4 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:13:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977306, now seen corresponding path program 1 times [2018-01-25 03:13:59,219 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:13:59,220 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:59,221 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:13:59,221 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:13:59,221 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:13:59,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:13:59,246 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:13:59,409 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:13:59,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:13:59,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:13:59,410 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:13:59,410 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:13:59,410 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:13:59,410 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:13:59,410 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-01-25 03:14:00,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:00,361 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-25 03:14:00,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:14:00,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 03:14:00,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:00,368 INFO L225 Difference]: With dead ends: 128 [2018-01-25 03:14:00,368 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 03:14:00,368 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:14:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 03:14:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-01-25 03:14:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:14:00,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-25 03:14:00,389 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2018-01-25 03:14:00,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:00,389 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-25 03:14:00,389 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:14:00,390 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-25 03:14:00,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:14:00,390 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:00,390 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:00,391 INFO L371 AbstractCegarLoop]: === Iteration 5 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:00,391 INFO L82 PathProgramCache]: Analyzing trace with hash 150721727, now seen corresponding path program 1 times [2018-01-25 03:14:00,391 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:00,392 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:00,393 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:00,393 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:00,393 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:00,413 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:00,463 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:14:00,477 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:00,477 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:14:00,477 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:00,478 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:14:00,478 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:14:00,478 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:14:00,478 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2018-01-25 03:14:01,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:01,181 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 03:14:01,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:14:01,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:14:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:01,183 INFO L225 Difference]: With dead ends: 122 [2018-01-25 03:14:01,183 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 03:14:01,184 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:01,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 03:14:01,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-25 03:14:01,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-25 03:14:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-01-25 03:14:01,215 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 15 [2018-01-25 03:14:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:01,216 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-01-25 03:14:01,216 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:14:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-01-25 03:14:01,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:14:01,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:01,217 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:01,217 INFO L371 AbstractCegarLoop]: === Iteration 6 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:01,217 INFO L82 PathProgramCache]: Analyzing trace with hash 150721728, now seen corresponding path program 1 times [2018-01-25 03:14:01,217 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:01,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:01,222 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:01,222 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:01,222 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:01,283 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:01,450 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:14:01,450 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:01,451 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:14:01,451 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:01,451 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:14:01,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:14:01,451 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:14:01,452 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2018-01-25 03:14:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:01,700 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-25 03:14:01,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:14:01,701 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:14:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:01,702 INFO L225 Difference]: With dead ends: 121 [2018-01-25 03:14:01,702 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 03:14:01,703 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:01,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 03:14:01,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-25 03:14:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 03:14:01,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-25 03:14:01,714 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 15 [2018-01-25 03:14:01,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:01,714 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-25 03:14:01,715 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:14:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-25 03:14:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:14:01,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:01,716 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:01,716 INFO L371 AbstractCegarLoop]: === Iteration 7 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:01,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099981, now seen corresponding path program 1 times [2018-01-25 03:14:01,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:01,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:01,718 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:01,718 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:01,718 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:01,747 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:01,818 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:14:01,819 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:01,819 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:14:01,819 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:01,820 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:14:01,820 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:14:01,820 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:01,820 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2018-01-25 03:14:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:02,320 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-01-25 03:14:02,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:14:02,321 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 03:14:02,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:02,322 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:14:02,323 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 03:14:02,323 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:14:02,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 03:14:02,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-01-25 03:14:02,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:14:02,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-01-25 03:14:02,336 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2018-01-25 03:14:02,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:02,336 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-01-25 03:14:02,336 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:14:02,336 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-01-25 03:14:02,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:14:02,337 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:02,338 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:02,338 INFO L371 AbstractCegarLoop]: === Iteration 8 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:02,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099982, now seen corresponding path program 1 times [2018-01-25 03:14:02,338 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:02,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:02,339 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:02,339 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:02,340 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:02,376 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 03:14:02,656 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:02,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:14:02,656 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:02,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:14:02,657 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:14:02,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:02,657 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 5 states. [2018-01-25 03:14:03,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:03,582 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-25 03:14:03,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:14:03,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 03:14:03,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:03,584 INFO L225 Difference]: With dead ends: 130 [2018-01-25 03:14:03,584 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 03:14:03,585 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:14:03,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 03:14:03,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-01-25 03:14:03,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:14:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-25 03:14:03,600 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 22 [2018-01-25 03:14:03,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:03,600 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-25 03:14:03,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:14:03,600 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-25 03:14:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:14:03,601 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:03,601 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:14:03,602 INFO L371 AbstractCegarLoop]: === Iteration 9 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:03,602 INFO L82 PathProgramCache]: Analyzing trace with hash 4873111, now seen corresponding path program 1 times [2018-01-25 03:14:03,602 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:03,603 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:03,608 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:03,608 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:03,609 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:03,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:03,665 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:03,808 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:14:03,808 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:03,808 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:14:03,809 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:03,810 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:14:03,810 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:14:03,811 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:14:03,811 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 4 states. [2018-01-25 03:14:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:04,211 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-25 03:14:04,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:14:04,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-25 03:14:04,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:04,213 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:14:04,213 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 03:14:04,213 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:04,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 03:14:04,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-25 03:14:04,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:14:04,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-25 03:14:04,231 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 23 [2018-01-25 03:14:04,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:04,232 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-25 03:14:04,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:14:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-25 03:14:04,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:14:04,233 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:04,233 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:14:04,233 INFO L371 AbstractCegarLoop]: === Iteration 10 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:04,234 INFO L82 PathProgramCache]: Analyzing trace with hash 4873112, now seen corresponding path program 1 times [2018-01-25 03:14:04,234 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:04,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:04,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:04,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:04,235 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:04,253 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:04,419 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:14:04,420 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:04,420 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:14:04,420 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:04,420 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:14:04,421 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:14:04,421 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:14:04,421 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-01-25 03:14:04,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:04,848 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-25 03:14:04,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:14:04,850 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-25 03:14:04,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:04,852 INFO L225 Difference]: With dead ends: 125 [2018-01-25 03:14:04,852 INFO L226 Difference]: Without dead ends: 123 [2018-01-25 03:14:04,852 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:04,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-25 03:14:04,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-01-25 03:14:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 03:14:04,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-25 03:14:04,861 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 23 [2018-01-25 03:14:04,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:04,862 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-25 03:14:04,862 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:14:04,862 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-25 03:14:04,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:14:04,863 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:04,863 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:04,863 INFO L371 AbstractCegarLoop]: === Iteration 11 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:04,864 INFO L82 PathProgramCache]: Analyzing trace with hash 167210254, now seen corresponding path program 1 times [2018-01-25 03:14:04,864 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:04,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:04,866 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:04,866 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:04,866 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:04,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:04,883 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:05,036 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:14:05,036 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:05,037 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:14:05,037 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:05,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:14:05,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:14:05,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:14:05,038 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 4 states. [2018-01-25 03:14:05,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:05,570 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-01-25 03:14:05,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:14:05,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-25 03:14:05,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:05,572 INFO L225 Difference]: With dead ends: 129 [2018-01-25 03:14:05,572 INFO L226 Difference]: Without dead ends: 128 [2018-01-25 03:14:05,572 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:14:05,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-25 03:14:05,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-01-25 03:14:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:14:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-25 03:14:05,587 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 24 [2018-01-25 03:14:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:05,588 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-25 03:14:05,588 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:14:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-25 03:14:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:14:05,589 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:05,589 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:05,589 INFO L371 AbstractCegarLoop]: === Iteration 12 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:05,589 INFO L82 PathProgramCache]: Analyzing trace with hash 167210255, now seen corresponding path program 1 times [2018-01-25 03:14:05,589 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:05,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:05,591 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:05,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:05,591 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:05,621 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:05,870 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:14:05,870 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:05,871 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:14:05,871 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:05,871 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:14:05,871 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:14:05,871 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:14:05,872 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-01-25 03:14:06,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:06,407 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-25 03:14:06,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:14:06,428 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 03:14:06,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:06,430 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:14:06,430 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 03:14:06,431 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:14:06,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 03:14:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-25 03:14:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:14:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-25 03:14:06,441 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2018-01-25 03:14:06,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:06,442 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-25 03:14:06,442 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:14:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-25 03:14:06,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:14:06,443 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:06,444 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:06,444 INFO L371 AbstractCegarLoop]: === Iteration 13 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:06,444 INFO L82 PathProgramCache]: Analyzing trace with hash 151037655, now seen corresponding path program 1 times [2018-01-25 03:14:06,444 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:06,445 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:06,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:06,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:06,449 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:06,495 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:06,620 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:14:06,620 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:06,620 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:14:06,620 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:06,621 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:14:06,621 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:14:06,621 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:06,622 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 5 states. [2018-01-25 03:14:07,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:07,059 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 03:14:07,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:14:07,060 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 03:14:07,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:07,061 INFO L225 Difference]: With dead ends: 122 [2018-01-25 03:14:07,061 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 03:14:07,062 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:14:07,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 03:14:07,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-25 03:14:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 03:14:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-25 03:14:07,070 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-01-25 03:14:07,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:07,071 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-25 03:14:07,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:14:07,071 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-25 03:14:07,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:14:07,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:07,072 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] [2018-01-25 03:14:07,072 INFO L371 AbstractCegarLoop]: === Iteration 14 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:07,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005000, now seen corresponding path program 1 times [2018-01-25 03:14:07,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:07,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:07,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:07,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:07,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:07,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:07,339 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:14:07,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:07,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:14:07,339 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:07,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:14:07,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:14:07,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:14:07,340 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 8 states. [2018-01-25 03:14:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:08,815 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-01-25 03:14:08,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:14:08,815 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-25 03:14:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:08,817 INFO L225 Difference]: With dead ends: 132 [2018-01-25 03:14:08,817 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 03:14:08,818 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:14:08,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 03:14:08,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-25 03:14:08,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:14:08,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-01-25 03:14:08,846 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 29 [2018-01-25 03:14:08,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:08,846 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-01-25 03:14:08,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:14:08,846 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-01-25 03:14:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:14:08,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:08,847 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] [2018-01-25 03:14:08,848 INFO L371 AbstractCegarLoop]: === Iteration 15 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005001, now seen corresponding path program 1 times [2018-01-25 03:14:08,855 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:08,856 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:08,856 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:08,857 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:08,857 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:08,903 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:09,277 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:14:09,277 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:09,277 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:14:09,277 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:09,278 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:14:09,278 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:14:09,278 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:14:09,278 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2018-01-25 03:14:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:10,036 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2018-01-25 03:14:10,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:14:10,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-25 03:14:10,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:10,038 INFO L225 Difference]: With dead ends: 132 [2018-01-25 03:14:10,038 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 03:14:10,038 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:14:10,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 03:14:10,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-25 03:14:10,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:14:10,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-25 03:14:10,051 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 29 [2018-01-25 03:14:10,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:10,051 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-25 03:14:10,051 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:14:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-25 03:14:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:14:10,053 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:10,062 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] [2018-01-25 03:14:10,063 INFO L371 AbstractCegarLoop]: === Iteration 16 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:10,063 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344885, now seen corresponding path program 1 times [2018-01-25 03:14:10,063 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:10,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,064 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:10,064 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:10,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:10,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:10,113 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:14:10,113 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:10,113 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:14:10,113 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:10,114 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:14:10,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:14:10,114 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:10,114 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-01-25 03:14:10,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:10,216 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-25 03:14:10,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:14:10,216 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-25 03:14:10,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:10,217 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:14:10,217 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 03:14:10,218 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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:14:10,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 03:14:10,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-25 03:14:10,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:14:10,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-01-25 03:14:10,226 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-01-25 03:14:10,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:10,227 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-01-25 03:14:10,227 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:14:10,227 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-01-25 03:14:10,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:14:10,228 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:10,228 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] [2018-01-25 03:14:10,228 INFO L371 AbstractCegarLoop]: === Iteration 17 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:10,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344886, now seen corresponding path program 1 times [2018-01-25 03:14:10,229 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:10,229 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,230 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:10,230 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,230 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:10,242 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:10,429 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:14:10,429 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:10,429 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:14:10,430 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:10,430 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:14:10,430 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:14:10,430 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:14:10,430 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-01-25 03:14:10,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:10,662 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-01-25 03:14:10,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:14:10,663 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 03:14:10,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:10,664 INFO L225 Difference]: With dead ends: 131 [2018-01-25 03:14:10,664 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 03:14:10,665 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:14:10,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 03:14:10,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-01-25 03:14:10,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:14:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-25 03:14:10,673 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2018-01-25 03:14:10,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:10,674 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-25 03:14:10,675 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:14:10,675 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-25 03:14:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:14:10,675 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:10,676 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] [2018-01-25 03:14:10,676 INFO L371 AbstractCegarLoop]: === Iteration 18 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:10,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765284, now seen corresponding path program 1 times [2018-01-25 03:14:10,676 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:10,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,677 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:10,677 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,677 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:10,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:10,687 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:10,739 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:14:10,739 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:10,739 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:14:10,739 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:10,739 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:14:10,740 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:14:10,740 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:14:10,740 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2018-01-25 03:14:10,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:10,891 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-01-25 03:14:10,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:14:10,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-25 03:14:10,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:10,892 INFO L225 Difference]: With dead ends: 131 [2018-01-25 03:14:10,892 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 03:14:10,893 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:14:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 03:14:10,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-01-25 03:14:10,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 03:14:10,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-01-25 03:14:10,902 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 30 [2018-01-25 03:14:10,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:10,903 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-01-25 03:14:10,903 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:14:10,903 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-01-25 03:14:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:14:10,904 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:10,904 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] [2018-01-25 03:14:10,905 INFO L371 AbstractCegarLoop]: === Iteration 19 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765283, now seen corresponding path program 1 times [2018-01-25 03:14:10,905 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:10,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,906 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:10,906 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:10,906 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:10,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:10,919 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:11,010 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:14:11,010 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:11,010 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:14:11,010 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:11,010 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:14:11,011 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:14:11,011 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:14:11,011 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2018-01-25 03:14:11,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:11,145 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2018-01-25 03:14:11,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:14:11,146 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 03:14:11,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:11,146 INFO L225 Difference]: With dead ends: 235 [2018-01-25 03:14:11,146 INFO L226 Difference]: Without dead ends: 125 [2018-01-25 03:14:11,147 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:14:11,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-25 03:14:11,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-01-25 03:14:11,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 03:14:11,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-25 03:14:11,157 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-01-25 03:14:11,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:11,157 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-25 03:14:11,158 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:14:11,158 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-25 03:14:11,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:14:11,160 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:11,160 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:14:11,160 INFO L371 AbstractCegarLoop]: === Iteration 20 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:11,160 INFO L82 PathProgramCache]: Analyzing trace with hash 660985097, now seen corresponding path program 1 times [2018-01-25 03:14:11,160 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:11,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:11,161 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:11,161 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:11,161 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:11,178 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:11,619 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:14:11,619 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:11,619 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:14:11,619 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:11,620 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:14:11,620 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:14:11,620 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:14:11,620 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2018-01-25 03:14:12,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:12,330 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-01-25 03:14:12,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:14:12,332 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-25 03:14:12,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:12,333 INFO L225 Difference]: With dead ends: 135 [2018-01-25 03:14:12,334 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 03:14:12,334 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:14:12,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 03:14:12,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-01-25 03:14:12,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 03:14:12,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-25 03:14:12,360 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 31 [2018-01-25 03:14:12,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:12,361 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-25 03:14:12,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:14:12,361 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-25 03:14:12,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:14:12,365 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:12,365 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:14:12,365 INFO L371 AbstractCegarLoop]: === Iteration 21 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:12,365 INFO L82 PathProgramCache]: Analyzing trace with hash 660985098, now seen corresponding path program 1 times [2018-01-25 03:14:12,366 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:12,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:12,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:12,367 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:12,367 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:12,398 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:12,565 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:14:12,565 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:14:12,566 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:14:12,566 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:14:12,566 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:14:12,566 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:14:12,566 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:14:12,566 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 10 states. [2018-01-25 03:14:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:14:13,079 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-01-25 03:14:13,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 03:14:13,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 03:14:13,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:14:13,081 INFO L225 Difference]: With dead ends: 134 [2018-01-25 03:14:13,081 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 03:14:13,081 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:14:13,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 03:14:13,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-01-25 03:14:13,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-25 03:14:13,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-01-25 03:14:13,091 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 31 [2018-01-25 03:14:13,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:14:13,091 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-01-25 03:14:13,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:14:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-01-25 03:14:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:14:13,091 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:14:13,092 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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:14:13,092 INFO L371 AbstractCegarLoop]: === Iteration 22 === [create_dataErr4RequiresViolation, create_dataErr6RequiresViolation, create_dataErr0RequiresViolation, create_dataErr5RequiresViolation, create_dataErr3RequiresViolation, create_dataErr1RequiresViolation, create_dataErr7RequiresViolation, create_dataErr9RequiresViolation, create_dataErr2RequiresViolation, create_dataErr8RequiresViolation, freeDataErr6RequiresViolation, freeDataErr2RequiresViolation, freeDataErr4RequiresViolation, freeDataErr5RequiresViolation, freeDataErr3RequiresViolation, freeDataErr0RequiresViolation, freeDataErr1RequiresViolation, freeDataErr7RequiresViolation, mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr18EnsuresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr4RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr5RequiresViolation, appendErr6RequiresViolation]=== [2018-01-25 03:14:13,092 INFO L82 PathProgramCache]: Analyzing trace with hash -184722078, now seen corresponding path program 1 times [2018-01-25 03:14:13,092 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:14:13,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:13,093 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:14:13,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:14:13,093 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:14:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:14:13,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:14:13,585 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-25 03:14:13,586 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:14:13,586 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:14:13,586 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 03:14:13,588 INFO L201 CegarAbsIntRunner]: [0], [3], [48], [49], [50], [53], [57], [60], [65], [139], [140], [144], [145], [146], [147], [149], [150], [153], [155], [158], [159], [162], [163], [164], [167], [168], [169], [171], [172] [2018-01-25 03:14:13,640 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:14:13,640 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) Received shutdown request... Cannot interrupt operation gracefully because timeout expired. Forcing shutdown