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_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 03:11:34,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 03:11:34,464 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 03:11:34,485 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 03:11:34,485 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 03:11:34,486 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 03:11:34,488 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 03:11:34,490 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 03:11:34,493 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 03:11:34,494 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 03:11:34,495 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 03:11:34,496 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 03:11:34,497 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 03:11:34,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 03:11:34,505 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 03:11:34,513 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 03:11:34,516 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 03:11:34,525 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 03:11:34,527 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 03:11:34,529 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 03:11:34,537 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 03:11:34,537 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 03:11:34,537 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 03:11:34,539 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 03:11:34,549 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 03:11:34,551 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 03:11:34,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 03:11:34,558 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 03:11:34,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 03:11:34,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 03:11:34,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 03:11:34,560 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:11:34,591 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 03:11:34,591 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 03:11:34,592 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 03:11:34,592 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 03:11:34,593 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 03:11:34,593 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 03:11:34,593 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 03:11:34,593 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 03:11:34,593 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 03:11:34,594 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 03:11:34,594 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 03:11:34,594 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 03:11:34,595 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 03:11:34,595 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 03:11:34,595 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 03:11:34,595 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 03:11:34,595 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 03:11:34,596 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 03:11:34,596 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 03:11:34,596 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 03:11:34,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 03:11:34,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 03:11:34,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 03:11:34,597 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 03:11:34,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 03:11:34,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 03:11:34,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 03:11:34,597 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 03:11:34,598 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 03:11:34,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 03:11:34,598 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 03:11:34,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 03:11:34,598 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 03:11:34,598 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 03:11:34,599 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 03:11:34,600 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 03:11:34,600 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 03:11:34,654 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 03:11:34,671 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 03:11:34,684 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 03:11:34,687 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 03:11:34,692 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 03:11:34,693 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_false-valid-memtrack.i [2018-01-25 03:11:35,067 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 03:11:35,078 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 03:11:35,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 03:11:35,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 03:11:35,088 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 03:11:35,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a45686f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35, skipping insertion in model container [2018-01-25 03:11:35,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,121 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:11:35,194 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 03:11:35,357 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:11:35,389 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 03:11:35,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35 WrapperNode [2018-01-25 03:11:35,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 03:11:35,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 03:11:35,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 03:11:35,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 03:11:35,425 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,425 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,440 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (1/1) ... [2018-01-25 03:11:35,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 03:11:35,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 03:11:35,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 03:11:35,468 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 03:11:35,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (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:11:35,555 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 03:11:35,555 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 03:11:35,555 INFO L136 BoogieDeclarations]: Found implementation of procedure create_data [2018-01-25 03:11:35,555 INFO L136 BoogieDeclarations]: Found implementation of procedure freeData [2018-01-25 03:11:35,556 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-25 03:11:35,556 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 03:11:35,556 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 03:11:35,556 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 03:11:35,556 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-25 03:11:35,556 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-25 03:11:35,557 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 03:11:35,557 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 03:11:35,557 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 03:11:35,557 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-25 03:11:35,557 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-25 03:11:35,557 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 03:11:35,558 INFO L128 BoogieDeclarations]: Found specification of procedure create_data [2018-01-25 03:11:35,558 INFO L128 BoogieDeclarations]: Found specification of procedure freeData [2018-01-25 03:11:35,558 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-25 03:11:35,558 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 03:11:35,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 03:11:35,558 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 03:11:36,775 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 03:11:36,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:11:36 BoogieIcfgContainer [2018-01-25 03:11:36,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 03:11:36,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 03:11:36,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 03:11:36,787 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 03:11:36,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 03:11:35" (1/3) ... [2018-01-25 03:11:36,789 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1a401e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:11:36, skipping insertion in model container [2018-01-25 03:11:36,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 03:11:35" (2/3) ... [2018-01-25 03:11:36,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1a401e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 03:11:36, skipping insertion in model container [2018-01-25 03:11:36,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 03:11:36" (3/3) ... [2018-01-25 03:11:36,799 INFO L105 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i [2018-01-25 03:11:36,822 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 03:11:36,840 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-01-25 03:11:36,906 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 03:11:36,906 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 03:11:36,906 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 03:11:36,906 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 03:11:36,906 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 03:11:36,906 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 03:11:36,907 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 03:11:36,907 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 03:11:36,908 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 03:11:36,943 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states. [2018-01-25 03:11:36,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:11:36,951 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:36,952 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:11:36,953 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:11:36,959 INFO L82 PathProgramCache]: Analyzing trace with hash -548983798, now seen corresponding path program 1 times [2018-01-25 03:11:36,962 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:37,081 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:37,845 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:37,846 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:37,846 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:37,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:37,941 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:38,069 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:11:38,072 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:38,072 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:11:38,072 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:38,076 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:11:38,092 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:11:38,100 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:11:38,103 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 3 states. [2018-01-25 03:11:38,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:38,705 INFO L93 Difference]: Finished difference Result 235 states and 262 transitions. [2018-01-25 03:11:38,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:11:38,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:11:38,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:38,734 INFO L225 Difference]: With dead ends: 235 [2018-01-25 03:11:38,734 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 03:11:38,746 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:11:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 03:11:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2018-01-25 03:11:38,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 03:11:38,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2018-01-25 03:11:38,827 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 7 [2018-01-25 03:11:38,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:38,827 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2018-01-25 03:11:38,827 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:11:38,827 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2018-01-25 03:11:38,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-25 03:11:38,828 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:38,828 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:11:38,828 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:11:38,829 INFO L82 PathProgramCache]: Analyzing trace with hash -548983797, now seen corresponding path program 1 times [2018-01-25 03:11:38,829 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:38,830 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:38,830 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:38,831 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:38,831 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:38,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:38,861 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:38,963 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:11:38,963 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:38,963 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-25 03:11:38,963 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:38,965 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-25 03:11:38,965 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-25 03:11:38,965 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-25 03:11:38,965 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 3 states. [2018-01-25 03:11:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:39,250 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2018-01-25 03:11:39,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-25 03:11:39,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-25 03:11:39,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:39,255 INFO L225 Difference]: With dead ends: 119 [2018-01-25 03:11:39,255 INFO L226 Difference]: Without dead ends: 118 [2018-01-25 03:11:39,256 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:11:39,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-25 03:11:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2018-01-25 03:11:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-01-25 03:11:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2018-01-25 03:11:39,268 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 7 [2018-01-25 03:11:39,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:39,268 INFO L432 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2018-01-25 03:11:39,269 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-25 03:11:39,269 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2018-01-25 03:11:39,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:11:39,269 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:39,270 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:11:39,270 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:11:39,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977305, now seen corresponding path program 1 times [2018-01-25 03:11:39,270 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:39,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:39,271 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:39,271 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:39,272 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:39,302 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:39,465 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:11:39,466 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:39,466 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:11:39,466 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:39,466 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:11:39,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:11:39,467 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:11:39,470 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2018-01-25 03:11:41,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:41,326 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2018-01-25 03:11:41,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:11:41,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-25 03:11:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:41,328 INFO L225 Difference]: With dead ends: 130 [2018-01-25 03:11:41,328 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 03:11:41,329 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:11:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 03:11:41,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2018-01-25 03:11:41,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:11:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-25 03:11:41,361 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 14 [2018-01-25 03:11:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:41,361 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-25 03:11:41,361 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:11:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-25 03:11:41,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-25 03:11:41,367 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:41,367 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:11:41,367 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:11:41,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1805977306, now seen corresponding path program 1 times [2018-01-25 03:11:41,368 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:41,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:41,369 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:41,369 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:41,369 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:41,435 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:41,686 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:11:41,687 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:41,687 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:11:41,687 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:41,687 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:11:41,688 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:11:41,688 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:11:41,688 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-01-25 03:11:42,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:42,819 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2018-01-25 03:11:42,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:11:42,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-25 03:11:42,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:42,821 INFO L225 Difference]: With dead ends: 128 [2018-01-25 03:11:42,822 INFO L226 Difference]: Without dead ends: 127 [2018-01-25 03:11:42,822 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:11:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-25 03:11:42,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 122. [2018-01-25 03:11:42,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:11:42,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-25 03:11:42,859 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 14 [2018-01-25 03:11:42,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:42,859 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-25 03:11:42,859 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:11:42,859 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-25 03:11:42,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:11:42,860 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:42,860 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:11:42,860 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:11:42,861 INFO L82 PathProgramCache]: Analyzing trace with hash 150721727, now seen corresponding path program 1 times [2018-01-25 03:11:42,861 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:42,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:42,862 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:42,862 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:42,862 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:42,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:42,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:43,073 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:11:43,073 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:43,073 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:11:43,073 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:43,074 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:11:43,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:11:43,074 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:11:43,074 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 4 states. [2018-01-25 03:11:43,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:43,386 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 03:11:43,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:11:43,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:11:43,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:43,388 INFO L225 Difference]: With dead ends: 122 [2018-01-25 03:11:43,388 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 03:11:43,388 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:11:43,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 03:11:43,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-01-25 03:11:43,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-25 03:11:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-01-25 03:11:43,402 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 15 [2018-01-25 03:11:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:43,402 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-01-25 03:11:43,402 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:11:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-01-25 03:11:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 03:11:43,403 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:43,403 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:11:43,403 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:11:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash 150721728, now seen corresponding path program 1 times [2018-01-25 03:11:43,404 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:43,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:43,405 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:43,405 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:43,405 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:43,420 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:43,691 WARN L146 SmtUtils]: Spent 181ms on a formula simplification. DAG size of input: 13 DAG size of output 9 [2018-01-25 03:11:43,692 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:11:43,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:43,693 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:11:43,693 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:43,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:11:43,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:11:43,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:11:43,695 INFO L87 Difference]: Start difference. First operand 121 states and 129 transitions. Second operand 4 states. [2018-01-25 03:11:44,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:44,202 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2018-01-25 03:11:44,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:11:44,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-25 03:11:44,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:44,203 INFO L225 Difference]: With dead ends: 121 [2018-01-25 03:11:44,204 INFO L226 Difference]: Without dead ends: 120 [2018-01-25 03:11:44,204 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:11:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-01-25 03:11:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2018-01-25 03:11:44,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 03:11:44,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-25 03:11:44,240 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 15 [2018-01-25 03:11:44,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:44,240 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-25 03:11:44,240 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:11:44,240 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-25 03:11:44,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:11:44,241 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:44,241 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:11:44,242 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:11:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099981, now seen corresponding path program 1 times [2018-01-25 03:11:44,242 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:44,243 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:44,250 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:44,250 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:44,250 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:44,314 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:44,407 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:11:44,408 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:44,408 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:11:44,408 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:44,409 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:11:44,409 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:11:44,409 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:11:44,409 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 5 states. [2018-01-25 03:11:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:45,137 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2018-01-25 03:11:45,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:11:45,138 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 03:11:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:45,140 INFO L225 Difference]: With dead ends: 136 [2018-01-25 03:11:45,140 INFO L226 Difference]: Without dead ends: 135 [2018-01-25 03:11:45,141 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:11:45,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-25 03:11:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-01-25 03:11:45,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:11:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-01-25 03:11:45,155 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 22 [2018-01-25 03:11:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:45,155 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-01-25 03:11:45,155 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:11:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-01-25 03:11:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-25 03:11:45,157 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:45,157 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:11:45,157 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:11:45,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1247099982, now seen corresponding path program 1 times [2018-01-25 03:11:45,158 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:45,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:45,160 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:45,160 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:45,160 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:45,196 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:45,526 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:11:45,526 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:45,526 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:11:45,526 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:45,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:11:45,527 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:11:45,527 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:11:45,527 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 5 states. [2018-01-25 03:11:46,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:46,480 INFO L93 Difference]: Finished difference Result 130 states and 139 transitions. [2018-01-25 03:11:46,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 03:11:46,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-25 03:11:46,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:46,482 INFO L225 Difference]: With dead ends: 130 [2018-01-25 03:11:46,482 INFO L226 Difference]: Without dead ends: 129 [2018-01-25 03:11:46,482 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:11:46,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-01-25 03:11:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 123. [2018-01-25 03:11:46,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:11:46,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-25 03:11:46,497 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 22 [2018-01-25 03:11:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:46,497 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-25 03:11:46,497 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:11:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-25 03:11:46,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:11:46,498 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:46,498 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:11:46,499 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:11:46,499 INFO L82 PathProgramCache]: Analyzing trace with hash 4873111, now seen corresponding path program 1 times [2018-01-25 03:11:46,499 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:46,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:46,500 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:46,500 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:46,500 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:46,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:46,517 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:46,652 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:11:46,652 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:46,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:11:46,652 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:46,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:11:46,653 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:11:46,653 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:11:46,653 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 4 states. [2018-01-25 03:11:47,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:47,185 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-25 03:11:47,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:11:47,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-25 03:11:47,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:47,186 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:11:47,187 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 03:11:47,187 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:11:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 03:11:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-01-25 03:11:47,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:11:47,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-25 03:11:47,211 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 23 [2018-01-25 03:11:47,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:47,211 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-25 03:11:47,211 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:11:47,211 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-25 03:11:47,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-25 03:11:47,217 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:47,217 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:11:47,218 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:11:47,223 INFO L82 PathProgramCache]: Analyzing trace with hash 4873112, now seen corresponding path program 1 times [2018-01-25 03:11:47,223 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:47,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:47,224 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:47,224 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:47,225 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:47,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:47,248 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:47,415 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:11:47,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:47,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:11:47,415 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:47,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:11:47,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:11:47,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:11:47,416 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 4 states. [2018-01-25 03:11:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:47,874 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2018-01-25 03:11:47,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:11:47,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-25 03:11:47,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:47,877 INFO L225 Difference]: With dead ends: 125 [2018-01-25 03:11:47,877 INFO L226 Difference]: Without dead ends: 123 [2018-01-25 03:11:47,878 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:11:47,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-01-25 03:11:47,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2018-01-25 03:11:47,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-25 03:11:47,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2018-01-25 03:11:47,904 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 23 [2018-01-25 03:11:47,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:47,904 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2018-01-25 03:11:47,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:11:47,905 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2018-01-25 03:11:47,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:11:47,905 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:47,905 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:11:47,906 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:11:47,906 INFO L82 PathProgramCache]: Analyzing trace with hash 167210254, now seen corresponding path program 1 times [2018-01-25 03:11:47,906 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:47,907 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:47,910 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:47,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:47,911 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:47,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:47,949 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:48,091 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:11:48,092 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:48,092 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 03:11:48,092 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:48,092 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 03:11:48,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 03:11:48,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:11:48,093 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand 4 states. [2018-01-25 03:11:48,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:48,521 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2018-01-25 03:11:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:11:48,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-25 03:11:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:48,522 INFO L225 Difference]: With dead ends: 129 [2018-01-25 03:11:48,522 INFO L226 Difference]: Without dead ends: 128 [2018-01-25 03:11:48,522 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 03:11:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-01-25 03:11:48,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122. [2018-01-25 03:11:48,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:11:48,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 131 transitions. [2018-01-25 03:11:48,534 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 131 transitions. Word has length 24 [2018-01-25 03:11:48,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:48,537 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 131 transitions. [2018-01-25 03:11:48,537 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 03:11:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 131 transitions. [2018-01-25 03:11:48,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:11:48,538 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:48,538 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:11:48,538 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:11:48,539 INFO L82 PathProgramCache]: Analyzing trace with hash 167210255, now seen corresponding path program 1 times [2018-01-25 03:11:48,539 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:48,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:48,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:48,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:48,540 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:48,573 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:48,965 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:11:48,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:48,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:11:48,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:48,966 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:11:48,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:11:48,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:11:48,967 INFO L87 Difference]: Start difference. First operand 122 states and 131 transitions. Second operand 7 states. [2018-01-25 03:11:50,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:50,163 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-25 03:11:50,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:11:50,167 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-25 03:11:50,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:50,168 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:11:50,168 INFO L226 Difference]: Without dead ends: 122 [2018-01-25 03:11:50,169 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:11:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-01-25 03:11:50,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2018-01-25 03:11:50,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-01-25 03:11:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 130 transitions. [2018-01-25 03:11:50,181 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 130 transitions. Word has length 24 [2018-01-25 03:11:50,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:50,181 INFO L432 AbstractCegarLoop]: Abstraction has 122 states and 130 transitions. [2018-01-25 03:11:50,181 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:11:50,181 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 130 transitions. [2018-01-25 03:11:50,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-25 03:11:50,182 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:50,182 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:11:50,182 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:11:50,183 INFO L82 PathProgramCache]: Analyzing trace with hash 151037655, now seen corresponding path program 1 times [2018-01-25 03:11:50,183 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:50,184 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:50,184 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:50,187 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:50,187 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:50,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:50,204 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:50,356 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:11:50,357 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:50,357 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:11:50,357 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:50,357 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:11:50,358 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:11:50,358 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:11:50,358 INFO L87 Difference]: Start difference. First operand 122 states and 130 transitions. Second operand 5 states. [2018-01-25 03:11:50,668 WARN L143 SmtUtils]: Spent 154ms on a formula simplification that was a NOOP. DAG size: 20 [2018-01-25 03:11:51,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:51,693 INFO L93 Difference]: Finished difference Result 122 states and 130 transitions. [2018-01-25 03:11:51,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-25 03:11:51,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-01-25 03:11:51,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:51,695 INFO L225 Difference]: With dead ends: 122 [2018-01-25 03:11:51,696 INFO L226 Difference]: Without dead ends: 119 [2018-01-25 03:11:51,696 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:11:51,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-01-25 03:11:51,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2018-01-25 03:11:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-25 03:11:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 125 transitions. [2018-01-25 03:11:51,714 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 125 transitions. Word has length 24 [2018-01-25 03:11:51,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:51,714 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 125 transitions. [2018-01-25 03:11:51,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:11:51,714 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 125 transitions. [2018-01-25 03:11:51,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:11:51,716 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:51,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, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 03:11:51,716 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:11:51,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005000, now seen corresponding path program 1 times [2018-01-25 03:11:51,716 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:51,722 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:51,723 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:51,723 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:51,723 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:51,789 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:52,332 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:11:52,333 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:52,333 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:11:52,333 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:52,333 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:11:52,334 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:11:52,334 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:11:52,336 INFO L87 Difference]: Start difference. First operand 117 states and 125 transitions. Second operand 8 states. [2018-01-25 03:11:52,782 WARN L143 SmtUtils]: Spent 104ms on a formula simplification that was a NOOP. DAG size: 18 [2018-01-25 03:11:53,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:53,967 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2018-01-25 03:11:53,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:11:53,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-25 03:11:53,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:53,969 INFO L225 Difference]: With dead ends: 132 [2018-01-25 03:11:53,970 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 03:11:53,970 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:11:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 03:11:53,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-25 03:11:53,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:11:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 132 transitions. [2018-01-25 03:11:53,984 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 132 transitions. Word has length 29 [2018-01-25 03:11:53,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:53,985 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 132 transitions. [2018-01-25 03:11:53,985 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:11:53,985 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 132 transitions. [2018-01-25 03:11:53,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-25 03:11:53,986 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:53,986 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:11:53,986 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:11:53,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1118005001, now seen corresponding path program 1 times [2018-01-25 03:11:53,987 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:53,987 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:53,988 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:53,988 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:53,988 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:54,022 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:54,629 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:11:54,629 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:54,629 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 03:11:54,629 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:54,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 03:11:54,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 03:11:54,630 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:11:54,631 INFO L87 Difference]: Start difference. First operand 123 states and 132 transitions. Second operand 7 states. [2018-01-25 03:11:54,895 WARN L143 SmtUtils]: Spent 110ms on a formula simplification that was a NOOP. DAG size: 17 [2018-01-25 03:11:55,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:55,500 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2018-01-25 03:11:55,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:11:55,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-01-25 03:11:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:55,502 INFO L225 Difference]: With dead ends: 132 [2018-01-25 03:11:55,502 INFO L226 Difference]: Without dead ends: 131 [2018-01-25 03:11:55,503 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:11:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-01-25 03:11:55,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-01-25 03:11:55,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-01-25 03:11:55,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 131 transitions. [2018-01-25 03:11:55,518 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 131 transitions. Word has length 29 [2018-01-25 03:11:55,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:55,518 INFO L432 AbstractCegarLoop]: Abstraction has 123 states and 131 transitions. [2018-01-25 03:11:55,519 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 03:11:55,519 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 131 transitions. [2018-01-25 03:11:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:11:55,520 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:55,521 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:11:55,521 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:11:55,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344885, now seen corresponding path program 1 times [2018-01-25 03:11:55,521 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:55,522 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:55,533 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:55,533 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:55,533 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:55,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:55,550 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:55,717 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:11:55,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:55,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:11:55,717 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:55,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:11:55,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:11:55,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:11:55,718 INFO L87 Difference]: Start difference. First operand 123 states and 131 transitions. Second operand 5 states. [2018-01-25 03:11:56,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:56,549 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2018-01-25 03:11:56,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:11:56,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-25 03:11:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:56,550 INFO L225 Difference]: With dead ends: 123 [2018-01-25 03:11:56,551 INFO L226 Difference]: Without dead ends: 121 [2018-01-25 03:11:56,551 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:11:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-01-25 03:11:56,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-01-25 03:11:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:11:56,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 126 transitions. [2018-01-25 03:11:56,562 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 126 transitions. Word has length 30 [2018-01-25 03:11:56,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:56,562 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 126 transitions. [2018-01-25 03:11:56,562 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:11:56,562 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2018-01-25 03:11:56,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:11:56,564 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:56,564 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:11:56,564 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:11:56,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1228344886, now seen corresponding path program 1 times [2018-01-25 03:11:56,564 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:56,565 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:56,565 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:56,566 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:56,566 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:56,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:56,927 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:11:56,928 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:56,928 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:11:56,928 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:56,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:11:56,929 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:11:56,929 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:11:56,929 INFO L87 Difference]: Start difference. First operand 119 states and 126 transitions. Second operand 6 states. [2018-01-25 03:11:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:57,649 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-01-25 03:11:57,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:11:57,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 03:11:57,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:57,652 INFO L225 Difference]: With dead ends: 131 [2018-01-25 03:11:57,652 INFO L226 Difference]: Without dead ends: 126 [2018-01-25 03:11:57,652 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-01-25 03:11:57,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-25 03:11:57,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-01-25 03:11:57,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-01-25 03:11:57,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 127 transitions. [2018-01-25 03:11:57,663 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 127 transitions. Word has length 30 [2018-01-25 03:11:57,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:57,663 INFO L432 AbstractCegarLoop]: Abstraction has 119 states and 127 transitions. [2018-01-25 03:11:57,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:11:57,663 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2018-01-25 03:11:57,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:11:57,664 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:57,664 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:11:57,664 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:11:57,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765284, now seen corresponding path program 1 times [2018-01-25 03:11:57,664 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:57,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:57,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:57,666 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:57,666 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:57,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:57,677 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:57,770 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:11:57,771 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:57,771 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-25 03:11:57,771 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:57,771 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 03:11:57,771 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 03:11:57,771 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 03:11:57,772 INFO L87 Difference]: Start difference. First operand 119 states and 127 transitions. Second operand 5 states. [2018-01-25 03:11:58,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:58,370 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2018-01-25 03:11:58,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 03:11:58,371 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-01-25 03:11:58,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:58,372 INFO L225 Difference]: With dead ends: 131 [2018-01-25 03:11:58,372 INFO L226 Difference]: Without dead ends: 130 [2018-01-25 03:11:58,372 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:11:58,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-25 03:11:58,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 124. [2018-01-25 03:11:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 03:11:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 134 transitions. [2018-01-25 03:11:58,395 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 134 transitions. Word has length 30 [2018-01-25 03:11:58,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:58,395 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 134 transitions. [2018-01-25 03:11:58,396 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 03:11:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2018-01-25 03:11:58,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-01-25 03:11:58,406 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:58,406 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:11:58,406 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:11:58,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1343765283, now seen corresponding path program 1 times [2018-01-25 03:11:58,406 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:58,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:58,407 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:58,407 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:58,407 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:58,442 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:59,054 WARN L146 SmtUtils]: Spent 220ms on a formula simplification. DAG size of input: 18 DAG size of output 11 [2018-01-25 03:11:59,056 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:11:59,056 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:59,056 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 03:11:59,056 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:59,057 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 03:11:59,057 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 03:11:59,058 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-25 03:11:59,059 INFO L87 Difference]: Start difference. First operand 124 states and 134 transitions. Second operand 6 states. [2018-01-25 03:11:59,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:11:59,560 INFO L93 Difference]: Finished difference Result 235 states and 257 transitions. [2018-01-25 03:11:59,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-25 03:11:59,560 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-01-25 03:11:59,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:11:59,561 INFO L225 Difference]: With dead ends: 235 [2018-01-25 03:11:59,561 INFO L226 Difference]: Without dead ends: 125 [2018-01-25 03:11:59,562 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:11:59,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-01-25 03:11:59,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-01-25 03:11:59,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-01-25 03:11:59,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 132 transitions. [2018-01-25 03:11:59,580 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 132 transitions. Word has length 30 [2018-01-25 03:11:59,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:11:59,580 INFO L432 AbstractCegarLoop]: Abstraction has 124 states and 132 transitions. [2018-01-25 03:11:59,580 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 03:11:59,580 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 132 transitions. [2018-01-25 03:11:59,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:11:59,581 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:11:59,581 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:11:59,581 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:11:59,582 INFO L82 PathProgramCache]: Analyzing trace with hash 660985097, now seen corresponding path program 1 times [2018-01-25 03:11:59,582 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:11:59,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:59,583 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:11:59,583 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:11:59,583 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:11:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:11:59,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:11:59,759 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:11:59,759 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:11:59,760 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-25 03:11:59,760 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:11:59,760 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-25 03:11:59,760 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-25 03:11:59,760 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-01-25 03:11:59,761 INFO L87 Difference]: Start difference. First operand 124 states and 132 transitions. Second operand 8 states. [2018-01-25 03:11:59,992 WARN L143 SmtUtils]: Spent 105ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-25 03:12:00,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:12:00,728 INFO L93 Difference]: Finished difference Result 135 states and 144 transitions. [2018-01-25 03:12:00,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 03:12:00,728 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 31 [2018-01-25 03:12:00,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:12:00,730 INFO L225 Difference]: With dead ends: 135 [2018-01-25 03:12:00,730 INFO L226 Difference]: Without dead ends: 134 [2018-01-25 03:12:00,731 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-01-25 03:12:00,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-25 03:12:00,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 126. [2018-01-25 03:12:00,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-25 03:12:00,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 135 transitions. [2018-01-25 03:12:00,765 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 135 transitions. Word has length 31 [2018-01-25 03:12:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:12:00,765 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 135 transitions. [2018-01-25 03:12:00,765 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-25 03:12:00,765 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 135 transitions. [2018-01-25 03:12:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-01-25 03:12:00,766 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:12:00,766 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:12:00,766 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:12:00,766 INFO L82 PathProgramCache]: Analyzing trace with hash 660985098, now seen corresponding path program 1 times [2018-01-25 03:12:00,766 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:12:00,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:12:00,776 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:12:00,776 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:12:00,776 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:12:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:12:00,821 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:12:01,359 WARN L146 SmtUtils]: Spent 165ms on a formula simplification. DAG size of input: 17 DAG size of output 15 [2018-01-25 03:12:01,500 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:12:01,500 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 03:12:01,500 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-25 03:12:01,500 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 03:12:01,501 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-25 03:12:01,501 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-25 03:12:01,501 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-25 03:12:01,501 INFO L87 Difference]: Start difference. First operand 126 states and 135 transitions. Second operand 10 states. [2018-01-25 03:12:01,874 WARN L146 SmtUtils]: Spent 126ms on a formula simplification. DAG size of input: 28 DAG size of output 26 [2018-01-25 03:12:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 03:12:02,825 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2018-01-25 03:12:02,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-25 03:12:02,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-01-25 03:12:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 03:12:02,827 INFO L225 Difference]: With dead ends: 134 [2018-01-25 03:12:02,827 INFO L226 Difference]: Without dead ends: 133 [2018-01-25 03:12:02,828 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2018-01-25 03:12:02,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-01-25 03:12:02,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2018-01-25 03:12:02,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-01-25 03:12:02,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 129 transitions. [2018-01-25 03:12:02,839 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 129 transitions. Word has length 31 [2018-01-25 03:12:02,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 03:12:02,839 INFO L432 AbstractCegarLoop]: Abstraction has 121 states and 129 transitions. [2018-01-25 03:12:02,839 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-25 03:12:02,839 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 129 transitions. [2018-01-25 03:12:02,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-25 03:12:02,840 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 03:12:02,840 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:12:02,840 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:12:02,841 INFO L82 PathProgramCache]: Analyzing trace with hash -184722078, now seen corresponding path program 1 times [2018-01-25 03:12:02,841 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 03:12:02,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:12:02,842 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 03:12:02,842 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 03:12:02,842 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 03:12:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 03:12:02,857 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 03:12:03,449 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:12:03,450 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 03:12:03,450 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 03:12:03,450 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-01-25 03:12:03,452 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:12:03,500 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 03:12:03,500 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