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_mostprecise.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 20:28:06,141 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 20:28:06,143 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 20:28:06,157 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 20:28:06,158 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 20:28:06,159 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 20:28:06,160 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 20:28:06,162 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 20:28:06,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 20:28:06,164 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 20:28:06,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 20:28:06,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 20:28:06,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 20:28:06,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 20:28:06,168 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 20:28:06,170 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 20:28:06,172 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 20:28:06,174 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 20:28:06,175 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 20:28:06,176 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 20:28:06,179 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 20:28:06,179 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 20:28:06,179 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 20:28:06,180 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 20:28:06,181 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 20:28:06,182 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 20:28:06,182 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 20:28:06,183 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 20:28:06,183 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 20:28:06,183 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 20:28:06,184 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 20:28:06,184 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_mostprecise.epf [2018-01-24 20:28:06,194 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 20:28:06,194 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 20:28:06,195 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 20:28:06,195 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 20:28:06,195 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 20:28:06,196 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-24 20:28:06,196 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 20:28:06,196 INFO L133 SettingsManager]: * Precise comparison operator=true [2018-01-24 20:28:06,196 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 20:28:06,197 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 20:28:06,197 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 20:28:06,197 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 20:28:06,197 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 20:28:06,198 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 20:28:06,198 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 20:28:06,198 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 20:28:06,198 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 20:28:06,199 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 20:28:06,199 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 20:28:06,199 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 20:28:06,199 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 20:28:06,199 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 20:28:06,200 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 20:28:06,200 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 20:28:06,200 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 20:28:06,200 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 20:28:06,200 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 20:28:06,200 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 20:28:06,201 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 20:28:06,201 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 20:28:06,201 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-24 20:28:06,201 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 20:28:06,201 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 20:28:06,201 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 20:28:06,202 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-24 20:28:06,202 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 20:28:06,203 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 20:28:06,238 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 20:28:06,251 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 20:28:06,255 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 20:28:06,256 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 20:28:06,257 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 20:28:06,258 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0232_1_false-valid-memtrack_true-termination.i [2018-01-24 20:28:06,440 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 20:28:06,447 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 20:28:06,448 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 20:28:06,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 20:28:06,456 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 20:28:06,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13ee3542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06, skipping insertion in model container [2018-01-24 20:28:06,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,473 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:28:06,510 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 20:28:06,620 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:28:06,636 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 20:28:06,643 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06 WrapperNode [2018-01-24 20:28:06,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 20:28:06,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 20:28:06,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 20:28:06,645 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 20:28:06,661 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,672 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,672 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,676 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,679 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,680 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (1/1) ... [2018-01-24 20:28:06,682 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 20:28:06,682 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 20:28:06,682 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 20:28:06,682 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 20:28:06,683 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (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-24 20:28:06,729 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 20:28:06,730 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 20:28:06,730 INFO L136 BoogieDeclarations]: Found implementation of procedure append [2018-01-24 20:28:06,730 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 20:28:06,730 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-01-24 20:28:06,730 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-01-24 20:28:06,730 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 20:28:06,731 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 20:28:06,731 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 20:28:06,731 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-01-24 20:28:06,731 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-01-24 20:28:06,731 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-24 20:28:06,731 INFO L128 BoogieDeclarations]: Found specification of procedure append [2018-01-24 20:28:06,732 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 20:28:06,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 20:28:06,732 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 20:28:07,127 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 20:28:07,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:28:07 BoogieIcfgContainer [2018-01-24 20:28:07,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 20:28:07,129 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 20:28:07,129 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 20:28:07,131 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 20:28:07,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 08:28:06" (1/3) ... [2018-01-24 20:28:07,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22650010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:28:07, skipping insertion in model container [2018-01-24 20:28:07,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 08:28:06" (2/3) ... [2018-01-24 20:28:07,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22650010 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 08:28:07, skipping insertion in model container [2018-01-24 20:28:07,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 08:28:07" (3/3) ... [2018-01-24 20:28:07,135 INFO L105 eAbstractionObserver]: Analyzing ICFG test-0232_1_false-valid-memtrack_true-termination.i [2018-01-24 20:28:07,142 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 20:28:07,150 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 43 error locations. [2018-01-24 20:28:07,191 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 20:28:07,191 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 20:28:07,192 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 20:28:07,192 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 20:28:07,192 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 20:28:07,192 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 20:28:07,192 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 20:28:07,192 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 20:28:07,193 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 20:28:07,216 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states. [2018-01-24 20:28:07,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 20:28:07,221 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:07,222 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:07,223 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:07,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068532, now seen corresponding path program 1 times [2018-01-24 20:28:07,228 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:07,272 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:07,273 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:07,273 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:07,273 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:07,326 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:07,387 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-24 20:28:07,389 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:07,389 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:28:07,389 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:07,392 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:28:07,402 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:28:07,403 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:28:07,404 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 3 states. [2018-01-24 20:28:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:07,689 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2018-01-24 20:28:07,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:28:07,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 20:28:07,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:07,706 INFO L225 Difference]: With dead ends: 169 [2018-01-24 20:28:07,707 INFO L226 Difference]: Without dead ends: 107 [2018-01-24 20:28:07,710 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-24 20:28:07,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-01-24 20:28:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2018-01-24 20:28:07,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-01-24 20:28:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 108 transitions. [2018-01-24 20:28:07,760 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 108 transitions. Word has length 7 [2018-01-24 20:28:07,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:07,761 INFO L432 AbstractCegarLoop]: Abstraction has 102 states and 108 transitions. [2018-01-24 20:28:07,761 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:28:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 108 transitions. [2018-01-24 20:28:07,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-01-24 20:28:07,762 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:07,762 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:07,762 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:07,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1218068531, now seen corresponding path program 1 times [2018-01-24 20:28:07,762 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:07,763 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:07,764 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:07,764 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:07,764 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:07,780 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:07,844 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-24 20:28:07,844 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:07,844 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 20:28:07,844 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:07,846 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:28:07,846 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:28:07,846 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:28:07,847 INFO L87 Difference]: Start difference. First operand 102 states and 108 transitions. Second operand 3 states. [2018-01-24 20:28:07,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:07,931 INFO L93 Difference]: Finished difference Result 104 states and 111 transitions. [2018-01-24 20:28:07,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:28:07,931 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-01-24 20:28:07,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:07,933 INFO L225 Difference]: With dead ends: 104 [2018-01-24 20:28:07,933 INFO L226 Difference]: Without dead ends: 103 [2018-01-24 20:28:07,934 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-24 20:28:07,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-01-24 20:28:07,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2018-01-24 20:28:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-01-24 20:28:07,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2018-01-24 20:28:07,942 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 7 [2018-01-24 20:28:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:07,942 INFO L432 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2018-01-24 20:28:07,942 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:28:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2018-01-24 20:28:07,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:28:07,943 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:07,943 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:07,943 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:07,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515713, now seen corresponding path program 1 times [2018-01-24 20:28:07,943 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:07,944 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:07,945 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:07,945 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:07,945 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:07,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:07,967 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:08,040 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-24 20:28:08,040 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:08,040 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:28:08,041 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:08,041 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:28:08,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:28:08,041 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:28:08,041 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand 5 states. [2018-01-24 20:28:08,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:08,285 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2018-01-24 20:28:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 20:28:08,285 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-01-24 20:28:08,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:08,286 INFO L225 Difference]: With dead ends: 104 [2018-01-24 20:28:08,287 INFO L226 Difference]: Without dead ends: 99 [2018-01-24 20:28:08,287 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 20:28:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-01-24 20:28:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-01-24 20:28:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-01-24 20:28:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2018-01-24 20:28:08,293 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 14 [2018-01-24 20:28:08,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:08,293 INFO L432 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2018-01-24 20:28:08,293 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:28:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2018-01-24 20:28:08,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 20:28:08,294 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:08,294 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:08,294 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:08,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2000515714, now seen corresponding path program 1 times [2018-01-24 20:28:08,294 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:08,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,295 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:08,295 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,296 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:08,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:08,313 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:08,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-24 20:28:08,415 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:08,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:28:08,415 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:08,416 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:28:08,416 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:28:08,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:28:08,416 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand 7 states. [2018-01-24 20:28:08,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:08,579 INFO L93 Difference]: Finished difference Result 95 states and 100 transitions. [2018-01-24 20:28:08,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:28:08,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-01-24 20:28:08,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:08,580 INFO L225 Difference]: With dead ends: 95 [2018-01-24 20:28:08,580 INFO L226 Difference]: Without dead ends: 86 [2018-01-24 20:28:08,581 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:28:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-24 20:28:08,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-24 20:28:08,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-24 20:28:08,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2018-01-24 20:28:08,587 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 14 [2018-01-24 20:28:08,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:08,587 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2018-01-24 20:28:08,587 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:28:08,588 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2018-01-24 20:28:08,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 20:28:08,588 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:08,588 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:08,588 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:08,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445036, now seen corresponding path program 1 times [2018-01-24 20:28:08,588 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:08,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,589 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:08,589 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,590 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:08,600 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:08,627 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-24 20:28:08,628 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:08,628 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:28:08,628 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:08,628 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:28:08,628 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:28:08,629 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:28:08,629 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 4 states. [2018-01-24 20:28:08,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:08,705 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-01-24 20:28:08,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:28:08,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 20:28:08,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:08,707 INFO L225 Difference]: With dead ends: 86 [2018-01-24 20:28:08,707 INFO L226 Difference]: Without dead ends: 82 [2018-01-24 20:28:08,707 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:28:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-24 20:28:08,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-24 20:28:08,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-24 20:28:08,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2018-01-24 20:28:08,713 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 15 [2018-01-24 20:28:08,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:08,714 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2018-01-24 20:28:08,714 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:28:08,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2018-01-24 20:28:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 20:28:08,715 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:08,715 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:08,715 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:08,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1886445037, now seen corresponding path program 1 times [2018-01-24 20:28:08,715 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:08,716 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,716 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:08,717 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,717 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:08,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:08,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:08,793 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-24 20:28:08,793 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:08,793 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:28:08,793 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:08,793 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:28:08,794 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:28:08,794 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:28:08,794 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand 4 states. [2018-01-24 20:28:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:08,839 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2018-01-24 20:28:08,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:28:08,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-01-24 20:28:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:08,840 INFO L225 Difference]: With dead ends: 82 [2018-01-24 20:28:08,841 INFO L226 Difference]: Without dead ends: 78 [2018-01-24 20:28:08,841 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:28:08,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-24 20:28:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-24 20:28:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 20:28:08,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-24 20:28:08,846 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 15 [2018-01-24 20:28:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:08,847 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-24 20:28:08,847 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:28:08,847 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-24 20:28:08,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-24 20:28:08,847 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:08,847 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:08,848 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:08,848 INFO L82 PathProgramCache]: Analyzing trace with hash 198602156, now seen corresponding path program 1 times [2018-01-24 20:28:08,848 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:08,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,849 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:08,849 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:08,849 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:08,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:08,862 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:08,958 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-24 20:28:08,958 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:08,959 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:28:08,963 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:08,964 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:28:08,964 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:28:08,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:28:08,965 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 8 states. [2018-01-24 20:28:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:09,193 INFO L93 Difference]: Finished difference Result 163 states and 174 transitions. [2018-01-24 20:28:09,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-01-24 20:28:09,194 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-01-24 20:28:09,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:09,195 INFO L225 Difference]: With dead ends: 163 [2018-01-24 20:28:09,195 INFO L226 Difference]: Without dead ends: 93 [2018-01-24 20:28:09,196 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-01-24 20:28:09,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-24 20:28:09,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 88. [2018-01-24 20:28:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 20:28:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 20:28:09,204 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 20 [2018-01-24 20:28:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:09,205 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 20:28:09,205 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:28:09,205 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 20:28:09,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 20:28:09,207 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:09,207 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:09,207 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:09,207 INFO L82 PathProgramCache]: Analyzing trace with hash -524715473, now seen corresponding path program 1 times [2018-01-24 20:28:09,207 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:09,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,208 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:09,208 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,208 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:09,226 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:09,309 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-24 20:28:09,310 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:09,310 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-24 20:28:09,310 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:09,310 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-24 20:28:09,310 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-24 20:28:09,311 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:28:09,311 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 7 states. [2018-01-24 20:28:09,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:09,539 INFO L93 Difference]: Finished difference Result 109 states and 115 transitions. [2018-01-24 20:28:09,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:28:09,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2018-01-24 20:28:09,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:09,541 INFO L225 Difference]: With dead ends: 109 [2018-01-24 20:28:09,542 INFO L226 Difference]: Without dead ends: 108 [2018-01-24 20:28:09,542 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:28:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-01-24 20:28:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2018-01-24 20:28:09,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-01-24 20:28:09,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 95 transitions. [2018-01-24 20:28:09,550 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 95 transitions. Word has length 32 [2018-01-24 20:28:09,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:09,550 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 95 transitions. [2018-01-24 20:28:09,550 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-24 20:28:09,550 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 95 transitions. [2018-01-24 20:28:09,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 20:28:09,551 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:09,551 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:09,551 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:09,551 INFO L82 PathProgramCache]: Analyzing trace with hash -524715472, now seen corresponding path program 1 times [2018-01-24 20:28:09,551 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:09,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,552 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:09,552 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,552 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:09,569 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:09,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-24 20:28:09,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:09,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-24 20:28:09,717 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:09,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 20:28:09,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 20:28:09,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-01-24 20:28:09,718 INFO L87 Difference]: Start difference. First operand 89 states and 95 transitions. Second operand 9 states. [2018-01-24 20:28:09,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:09,929 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2018-01-24 20:28:09,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-01-24 20:28:09,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-01-24 20:28:09,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:09,931 INFO L225 Difference]: With dead ends: 106 [2018-01-24 20:28:09,931 INFO L226 Difference]: Without dead ends: 105 [2018-01-24 20:28:09,931 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2018-01-24 20:28:09,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-01-24 20:28:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 88. [2018-01-24 20:28:09,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-24 20:28:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 93 transitions. [2018-01-24 20:28:09,938 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 93 transitions. Word has length 32 [2018-01-24 20:28:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:09,938 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 93 transitions. [2018-01-24 20:28:09,938 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 20:28:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 93 transitions. [2018-01-24 20:28:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 20:28:09,940 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:09,940 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:09,940 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:09,940 INFO L82 PathProgramCache]: Analyzing trace with hash -524727421, now seen corresponding path program 1 times [2018-01-24 20:28:09,940 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:09,941 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,941 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:09,942 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,942 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:09,956 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:09,976 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-24 20:28:09,976 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:09,976 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:28:09,977 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:09,977 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:28:09,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:28:09,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:28:09,977 INFO L87 Difference]: Start difference. First operand 88 states and 93 transitions. Second operand 3 states. [2018-01-24 20:28:09,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:09,987 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2018-01-24 20:28:09,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:28:09,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-01-24 20:28:09,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:09,988 INFO L225 Difference]: With dead ends: 117 [2018-01-24 20:28:09,989 INFO L226 Difference]: Without dead ends: 76 [2018-01-24 20:28:09,989 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 20:28:09,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-01-24 20:28:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-01-24 20:28:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 20:28:09,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2018-01-24 20:28:09,995 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 32 [2018-01-24 20:28:09,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:09,995 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2018-01-24 20:28:09,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:28:09,996 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2018-01-24 20:28:09,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-01-24 20:28:09,997 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:09,997 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:09,997 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:09,998 INFO L82 PathProgramCache]: Analyzing trace with hash 947709807, now seen corresponding path program 1 times [2018-01-24 20:28:09,998 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:09,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,999 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:09,999 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:09,999 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:10,015 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:10,046 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-24 20:28:10,046 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:10,047 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 20:28:10,047 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:10,047 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 20:28:10,047 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 20:28:10,047 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 20:28:10,048 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand 3 states. [2018-01-24 20:28:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:10,063 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2018-01-24 20:28:10,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 20:28:10,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-01-24 20:28:10,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:10,064 INFO L225 Difference]: With dead ends: 99 [2018-01-24 20:28:10,064 INFO L226 Difference]: Without dead ends: 79 [2018-01-24 20:28:10,065 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 20:28:10,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-01-24 20:28:10,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-01-24 20:28:10,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-24 20:28:10,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2018-01-24 20:28:10,071 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 33 [2018-01-24 20:28:10,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:10,071 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2018-01-24 20:28:10,071 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 20:28:10,071 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2018-01-24 20:28:10,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 20:28:10,072 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:10,072 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:10,073 INFO L371 AbstractCegarLoop]: === Iteration 12 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:10,073 INFO L82 PathProgramCache]: Analyzing trace with hash 214855819, now seen corresponding path program 1 times [2018-01-24 20:28:10,073 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:10,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,074 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:10,074 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,074 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:10,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:10,088 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:10,126 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-24 20:28:10,126 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:10,126 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:28:10,126 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:10,127 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 20:28:10,127 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 20:28:10,127 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-24 20:28:10,127 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand 4 states. [2018-01-24 20:28:10,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:10,162 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2018-01-24 20:28:10,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 20:28:10,163 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-01-24 20:28:10,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:10,164 INFO L225 Difference]: With dead ends: 84 [2018-01-24 20:28:10,164 INFO L226 Difference]: Without dead ends: 77 [2018-01-24 20:28:10,164 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-24 20:28:10,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-01-24 20:28:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-01-24 20:28:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-01-24 20:28:10,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 79 transitions. [2018-01-24 20:28:10,170 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 79 transitions. Word has length 35 [2018-01-24 20:28:10,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:10,170 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 79 transitions. [2018-01-24 20:28:10,170 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 20:28:10,170 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 79 transitions. [2018-01-24 20:28:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 20:28:10,171 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:10,171 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:10,172 INFO L371 AbstractCegarLoop]: === Iteration 13 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322185, now seen corresponding path program 1 times [2018-01-24 20:28:10,172 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:10,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,173 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:10,173 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,173 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:10,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:10,187 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:10,266 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-24 20:28:10,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:10,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-24 20:28:10,267 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:10,267 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-24 20:28:10,267 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-24 20:28:10,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-01-24 20:28:10,268 INFO L87 Difference]: Start difference. First operand 76 states and 79 transitions. Second operand 8 states. [2018-01-24 20:28:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:10,401 INFO L93 Difference]: Finished difference Result 76 states and 79 transitions. [2018-01-24 20:28:10,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 20:28:10,401 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2018-01-24 20:28:10,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:10,402 INFO L225 Difference]: With dead ends: 76 [2018-01-24 20:28:10,402 INFO L226 Difference]: Without dead ends: 75 [2018-01-24 20:28:10,402 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:28:10,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-24 20:28:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-01-24 20:28:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-01-24 20:28:10,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 78 transitions. [2018-01-24 20:28:10,407 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 78 transitions. Word has length 35 [2018-01-24 20:28:10,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:10,407 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 78 transitions. [2018-01-24 20:28:10,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-24 20:28:10,407 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 78 transitions. [2018-01-24 20:28:10,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-01-24 20:28:10,408 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:10,408 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:10,409 INFO L371 AbstractCegarLoop]: === Iteration 14 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:10,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1882322186, now seen corresponding path program 1 times [2018-01-24 20:28:10,409 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:10,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,410 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:10,410 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,410 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:10,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:10,422 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:10,455 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-24 20:28:10,455 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:10,455 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 20:28:10,455 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:10,456 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 20:28:10,456 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 20:28:10,456 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 20:28:10,457 INFO L87 Difference]: Start difference. First operand 75 states and 78 transitions. Second operand 5 states. [2018-01-24 20:28:10,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:10,585 INFO L93 Difference]: Finished difference Result 75 states and 78 transitions. [2018-01-24 20:28:10,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 20:28:10,586 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-01-24 20:28:10,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:10,587 INFO L225 Difference]: With dead ends: 75 [2018-01-24 20:28:10,587 INFO L226 Difference]: Without dead ends: 74 [2018-01-24 20:28:10,588 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-24 20:28:10,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-24 20:28:10,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-24 20:28:10,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-24 20:28:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 77 transitions. [2018-01-24 20:28:10,593 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 77 transitions. Word has length 35 [2018-01-24 20:28:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:10,593 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 77 transitions. [2018-01-24 20:28:10,593 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 20:28:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 77 transitions. [2018-01-24 20:28:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-01-24 20:28:10,594 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:10,595 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 20:28:10,595 INFO L371 AbstractCegarLoop]: === Iteration 15 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:10,595 INFO L82 PathProgramCache]: Analyzing trace with hash 730389066, now seen corresponding path program 1 times [2018-01-24 20:28:10,595 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:10,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,596 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:10,596 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:10,596 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:10,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:10,783 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-24 20:28:10,783 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 20:28:10,783 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-24 20:28:10,783 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 20:28:10,784 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-24 20:28:10,784 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-24 20:28:10,784 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-01-24 20:28:10,784 INFO L87 Difference]: Start difference. First operand 74 states and 77 transitions. Second operand 10 states. [2018-01-24 20:28:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 20:28:10,990 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2018-01-24 20:28:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-24 20:28:10,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2018-01-24 20:28:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 20:28:10,991 INFO L225 Difference]: With dead ends: 74 [2018-01-24 20:28:10,991 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 20:28:10,992 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2018-01-24 20:28:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 20:28:10,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-01-24 20:28:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-24 20:28:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2018-01-24 20:28:10,998 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 37 [2018-01-24 20:28:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 20:28:10,999 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2018-01-24 20:28:10,999 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-24 20:28:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2018-01-24 20:28:10,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-01-24 20:28:10,999 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 20:28:11,000 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2018-01-24 20:28:11,000 INFO L371 AbstractCegarLoop]: === Iteration 16 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr26RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr25RequiresViolation, mainErr28EnsuresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr27RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr24RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation, appendErr0RequiresViolation, appendErr9RequiresViolation, appendErr13RequiresViolation, appendErr4RequiresViolation, appendErr8RequiresViolation, appendErr10RequiresViolation, appendErr5RequiresViolation, appendErr12RequiresViolation, appendErr11RequiresViolation, appendErr7RequiresViolation, appendErr3RequiresViolation, appendErr2RequiresViolation, appendErr1RequiresViolation, appendErr6RequiresViolation]=== [2018-01-24 20:28:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2123324108, now seen corresponding path program 1 times [2018-01-24 20:28:11,000 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-24 20:28:11,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:11,001 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 20:28:11,001 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 20:28:11,002 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 20:28:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 20:28:11,016 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 20:28:11,262 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 20:28:11,262 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 20:28:11,262 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-24 20:28:11,263 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-01-24 20:28:11,265 INFO L201 CegarAbsIntRunner]: [0], [1], [5], [6], [9], [13], [15], [17], [22], [101], [102], [103], [104], [107], [110], [111], [116], [117], [121], [125], [126], [127], [129], [132], [133], [136], [137], [138], [139], [141], [142] [2018-01-24 20:28:11,319 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-24 20:28:11,319 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