java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:24:44,904 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:24:44,906 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:24:44,922 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:24:44,922 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:24:44,925 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:24:44,927 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:24:44,935 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:24:44,941 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:24:44,942 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:24:44,943 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:24:44,944 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:24:44,945 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:24:44,947 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:24:44,948 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:24:44,949 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:24:44,950 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:24:44,951 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:24:44,952 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:24:44,954 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:24:44,956 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:24:44,957 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:24:44,958 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:24:44,959 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:24:44,961 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:24:44,961 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:24:44,962 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:24:44,963 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:24:44,963 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:24:44,964 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:24:44,964 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:24:44,965 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:24:44,966 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:24:44,966 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:24:44,967 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:24:44,967 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:24:44,968 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:24:44,968 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:24:44,969 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:24:44,970 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:24:44,970 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:24:44,971 INFO  L101        SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2019-10-13 21:24:44,988 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-10-13 21:24:44,988 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:24:44,990 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:24:44,990 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-10-13 21:24:44,991 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-10-13 21:24:44,991 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:24:44,991 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-10-13 21:24:44,991 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-10-13 21:24:44,991 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-10-13 21:24:44,992 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-10-13 21:24:44,992 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:24:44,992 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:24:44,992 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:24:44,992 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-10-13 21:24:44,993 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-10-13 21:24:44,993 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-10-13 21:24:44,993 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:24:44,993 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:24:44,993 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-10-13 21:24:44,994 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-10-13 21:24:44,994 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-10-13 21:24:44,994 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:24:44,996 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:24:44,996 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:24:44,996 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:24:44,997 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-10-13 21:24:44,997 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:24:44,997 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:24:44,997 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES
[2019-10-13 21:24:45,313 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:24:45,335 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:24:45,339 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:24:45,340 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-10-13 21:24:45,340 INFO  L275        PluginConnector]: CDTParser initialized
[2019-10-13 21:24:45,341 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c
[2019-10-13 21:24:45,423 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5533bba/a2bbf88ebc6242fabb9c24e685f76160/FLAGe55f38662
[2019-10-13 21:24:46,023 INFO  L306              CDTParser]: Found 1 translation units.
[2019-10-13 21:24:46,023 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c
[2019-10-13 21:24:46,053 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5533bba/a2bbf88ebc6242fabb9c24e685f76160/FLAGe55f38662
[2019-10-13 21:24:46,234 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d5533bba/a2bbf88ebc6242fabb9c24e685f76160
[2019-10-13 21:24:46,244 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:24:46,245 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:24:46,246 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:24:46,247 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:24:46,250 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:24:46,251 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:46" (1/1) ...
[2019-10-13 21:24:46,254 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230595d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:46, skipping insertion in model container
[2019-10-13 21:24:46,254 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:24:46" (1/1) ...
[2019-10-13 21:24:46,262 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-10-13 21:24:46,344 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:24:46,993 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:24:47,011 INFO  L188         MainTranslator]: Completed pre-run
[2019-10-13 21:24:47,476 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:24:47,499 INFO  L192         MainTranslator]: Completed translation
[2019-10-13 21:24:47,500 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47 WrapperNode
[2019-10-13 21:24:47,500 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:24:47,501 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:24:47,501 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:24:47,501 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:24:47,511 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
[2019-10-13 21:24:47,512 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
[2019-10-13 21:24:47,531 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
[2019-10-13 21:24:47,532 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
[2019-10-13 21:24:47,568 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
[2019-10-13 21:24:47,589 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
[2019-10-13 21:24:47,595 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
[2019-10-13 21:24:47,603 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:24:47,604 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:24:47,604 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:24:47,604 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:24:47,605 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (1/1) ...
No working directory specified, using /storage/repos/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
[2019-10-13 21:24:47,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:24:47,680 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:24:47,681 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:24:47,681 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:24:47,681 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char
[2019-10-13 21:24:47,681 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool
[2019-10-13 21:24:47,681 INFO  L130     BoogieDeclarations]: Found specification of procedure assert
[2019-10-13 21:24:47,682 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_assume
[2019-10-13 21:24:47,682 INFO  L130     BoogieDeclarations]: Found specification of procedure read
[2019-10-13 21:24:47,682 INFO  L130     BoogieDeclarations]: Found specification of procedure write
[2019-10-13 21:24:47,682 INFO  L130     BoogieDeclarations]: Found specification of procedure node1
[2019-10-13 21:24:47,683 INFO  L130     BoogieDeclarations]: Found specification of procedure node2
[2019-10-13 21:24:47,683 INFO  L130     BoogieDeclarations]: Found specification of procedure node3
[2019-10-13 21:24:47,683 INFO  L130     BoogieDeclarations]: Found specification of procedure init
[2019-10-13 21:24:47,683 INFO  L130     BoogieDeclarations]: Found specification of procedure check
[2019-10-13 21:24:47,683 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:24:47,684 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:24:47,684 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:24:49,420 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:24:49,421 INFO  L284             CfgBuilder]: Removed 0 assume(true) statements.
[2019-10-13 21:24:49,422 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:49 BoogieIcfgContainer
[2019-10-13 21:24:49,424 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:24:49,426 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:24:49,426 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:24:49,430 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:24:49,430 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:24:46" (1/3) ...
[2019-10-13 21:24:49,431 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf135e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:49, skipping insertion in model container
[2019-10-13 21:24:49,431 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:24:47" (2/3) ...
[2019-10-13 21:24:49,432 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bf135e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:24:49, skipping insertion in model container
[2019-10-13 21:24:49,432 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:24:49" (3/3) ...
[2019-10-13 21:24:49,442 INFO  L109   eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.4.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c
[2019-10-13 21:24:49,457 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:24:49,488 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations.
[2019-10-13 21:24:49,503 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 5 error locations.
[2019-10-13 21:24:49,552 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:24:49,552 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-10-13 21:24:49,553 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:24:49,553 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:24:49,553 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:24:49,553 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-10-13 21:24:49,553 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:24:49,554 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:24:49,591 INFO  L276                IsEmpty]: Start isEmpty. Operand 405 states.
[2019-10-13 21:24:49,611 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2019-10-13 21:24:49,611 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:49,612 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:49,614 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:49,618 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:49,619 INFO  L82        PathProgramCache]: Analyzing trace with hash 18427047, now seen corresponding path program 1 times
[2019-10-13 21:24:49,626 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:49,626 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603383263]
[2019-10-13 21:24:49,627 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:49,627 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:49,627 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:50,010 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:50,369 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:50,370 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603383263]
[2019-10-13 21:24:50,371 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:50,371 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:24:50,371 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75381752]
[2019-10-13 21:24:50,379 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:24:50,381 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:50,396 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:24:50,398 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:24:50,401 INFO  L87              Difference]: Start difference. First operand 405 states. Second operand 3 states.
[2019-10-13 21:24:50,633 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:50,633 INFO  L93              Difference]: Finished difference Result 734 states and 1290 transitions.
[2019-10-13 21:24:50,634 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:24:50,635 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 149
[2019-10-13 21:24:50,636 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:50,659 INFO  L225             Difference]: With dead ends: 734
[2019-10-13 21:24:50,659 INFO  L226             Difference]: Without dead ends: 573
[2019-10-13 21:24:50,669 INFO  L600         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
[2019-10-13 21:24:50,693 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 573 states.
[2019-10-13 21:24:50,800 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 571.
[2019-10-13 21:24:50,802 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 571 states.
[2019-10-13 21:24:50,805 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 834 transitions.
[2019-10-13 21:24:50,807 INFO  L78                 Accepts]: Start accepts. Automaton has 571 states and 834 transitions. Word has length 149
[2019-10-13 21:24:50,808 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:50,808 INFO  L462      AbstractCegarLoop]: Abstraction has 571 states and 834 transitions.
[2019-10-13 21:24:50,808 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:24:50,809 INFO  L276                IsEmpty]: Start isEmpty. Operand 571 states and 834 transitions.
[2019-10-13 21:24:50,813 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2019-10-13 21:24:50,814 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:50,814 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:50,814 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:50,815 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:50,815 INFO  L82        PathProgramCache]: Analyzing trace with hash 108834247, now seen corresponding path program 1 times
[2019-10-13 21:24:50,815 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:50,815 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093411193]
[2019-10-13 21:24:50,816 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:50,816 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:50,816 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:50,904 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:51,105 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:51,107 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093411193]
[2019-10-13 21:24:51,107 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:51,107 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:24:51,107 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338619076]
[2019-10-13 21:24:51,111 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:24:51,111 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:51,112 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:24:51,112 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:24:51,113 INFO  L87              Difference]: Start difference. First operand 571 states and 834 transitions. Second operand 3 states.
[2019-10-13 21:24:51,284 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:51,284 INFO  L93              Difference]: Finished difference Result 1144 states and 1727 transitions.
[2019-10-13 21:24:51,285 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:24:51,285 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 149
[2019-10-13 21:24:51,286 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:51,292 INFO  L225             Difference]: With dead ends: 1144
[2019-10-13 21:24:51,292 INFO  L226             Difference]: Without dead ends: 915
[2019-10-13 21:24:51,295 INFO  L600         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
[2019-10-13 21:24:51,297 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 915 states.
[2019-10-13 21:24:51,328 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 913.
[2019-10-13 21:24:51,328 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 913 states.
[2019-10-13 21:24:51,332 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1356 transitions.
[2019-10-13 21:24:51,333 INFO  L78                 Accepts]: Start accepts. Automaton has 913 states and 1356 transitions. Word has length 149
[2019-10-13 21:24:51,333 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:51,334 INFO  L462      AbstractCegarLoop]: Abstraction has 913 states and 1356 transitions.
[2019-10-13 21:24:51,334 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:24:51,334 INFO  L276                IsEmpty]: Start isEmpty. Operand 913 states and 1356 transitions.
[2019-10-13 21:24:51,338 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 150
[2019-10-13 21:24:51,339 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:51,340 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:51,341 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:51,341 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:51,341 INFO  L82        PathProgramCache]: Analyzing trace with hash -1956442329, now seen corresponding path program 1 times
[2019-10-13 21:24:51,342 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:51,342 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959300405]
[2019-10-13 21:24:51,342 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:51,342 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:51,343 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:51,544 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:51,707 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:51,708 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959300405]
[2019-10-13 21:24:51,708 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:51,708 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:24:51,709 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634085872]
[2019-10-13 21:24:51,709 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:24:51,710 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:51,710 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:24:51,710 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:24:51,710 INFO  L87              Difference]: Start difference. First operand 913 states and 1356 transitions. Second operand 4 states.
[2019-10-13 21:24:51,942 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:51,943 INFO  L93              Difference]: Finished difference Result 2677 states and 3967 transitions.
[2019-10-13 21:24:51,943 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-13 21:24:51,944 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 149
[2019-10-13 21:24:51,944 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:51,956 INFO  L225             Difference]: With dead ends: 2677
[2019-10-13 21:24:51,956 INFO  L226             Difference]: Without dead ends: 1777
[2019-10-13 21:24:51,959 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:24:51,963 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1777 states.
[2019-10-13 21:24:52,067 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1748.
[2019-10-13 21:24:52,067 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1748 states.
[2019-10-13 21:24:52,076 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1748 states to 1748 states and 2584 transitions.
[2019-10-13 21:24:52,076 INFO  L78                 Accepts]: Start accepts. Automaton has 1748 states and 2584 transitions. Word has length 149
[2019-10-13 21:24:52,077 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:52,077 INFO  L462      AbstractCegarLoop]: Abstraction has 1748 states and 2584 transitions.
[2019-10-13 21:24:52,077 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:24:52,077 INFO  L276                IsEmpty]: Start isEmpty. Operand 1748 states and 2584 transitions.
[2019-10-13 21:24:52,082 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 151
[2019-10-13 21:24:52,082 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:52,082 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:52,083 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:52,083 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:52,084 INFO  L82        PathProgramCache]: Analyzing trace with hash 970634365, now seen corresponding path program 1 times
[2019-10-13 21:24:52,084 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:52,084 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202988802]
[2019-10-13 21:24:52,085 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:52,085 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:52,085 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:52,119 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:52,207 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:52,208 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202988802]
[2019-10-13 21:24:52,208 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:52,209 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:24:52,209 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476438979]
[2019-10-13 21:24:52,210 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:24:52,210 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:52,211 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:24:52,211 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:24:52,211 INFO  L87              Difference]: Start difference. First operand 1748 states and 2584 transitions. Second operand 3 states.
[2019-10-13 21:24:52,377 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:52,378 INFO  L93              Difference]: Finished difference Result 5198 states and 7682 transitions.
[2019-10-13 21:24:52,378 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:24:52,378 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 150
[2019-10-13 21:24:52,379 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:52,397 INFO  L225             Difference]: With dead ends: 5198
[2019-10-13 21:24:52,397 INFO  L226             Difference]: Without dead ends: 3482
[2019-10-13 21:24:52,402 INFO  L600         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
[2019-10-13 21:24:52,406 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3482 states.
[2019-10-13 21:24:52,519 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 1750.
[2019-10-13 21:24:52,519 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1750 states.
[2019-10-13 21:24:52,528 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1750 states to 1750 states and 2586 transitions.
[2019-10-13 21:24:52,529 INFO  L78                 Accepts]: Start accepts. Automaton has 1750 states and 2586 transitions. Word has length 150
[2019-10-13 21:24:52,529 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:52,529 INFO  L462      AbstractCegarLoop]: Abstraction has 1750 states and 2586 transitions.
[2019-10-13 21:24:52,529 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:24:52,529 INFO  L276                IsEmpty]: Start isEmpty. Operand 1750 states and 2586 transitions.
[2019-10-13 21:24:52,534 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2019-10-13 21:24:52,534 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:52,534 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:52,535 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:52,535 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:52,535 INFO  L82        PathProgramCache]: Analyzing trace with hash 1963532230, now seen corresponding path program 1 times
[2019-10-13 21:24:52,536 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:52,536 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051222234]
[2019-10-13 21:24:52,536 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:52,536 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:52,537 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:52,686 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:52,824 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:52,825 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051222234]
[2019-10-13 21:24:52,826 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:52,826 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:24:52,826 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883038840]
[2019-10-13 21:24:52,827 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:24:52,827 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:52,828 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:24:52,828 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:24:52,829 INFO  L87              Difference]: Start difference. First operand 1750 states and 2586 transitions. Second operand 4 states.
[2019-10-13 21:24:52,959 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:52,959 INFO  L93              Difference]: Finished difference Result 3482 states and 5147 transitions.
[2019-10-13 21:24:52,960 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-13 21:24:52,960 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 151
[2019-10-13 21:24:52,960 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:52,970 INFO  L225             Difference]: With dead ends: 3482
[2019-10-13 21:24:52,971 INFO  L226             Difference]: Without dead ends: 1750
[2019-10-13 21:24:52,975 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:24:52,978 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 1750 states.
[2019-10-13 21:24:53,065 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1749.
[2019-10-13 21:24:53,065 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 1749 states.
[2019-10-13 21:24:53,074 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 1749 states to 1749 states and 2583 transitions.
[2019-10-13 21:24:53,074 INFO  L78                 Accepts]: Start accepts. Automaton has 1749 states and 2583 transitions. Word has length 151
[2019-10-13 21:24:53,075 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:53,076 INFO  L462      AbstractCegarLoop]: Abstraction has 1749 states and 2583 transitions.
[2019-10-13 21:24:53,076 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:24:53,076 INFO  L276                IsEmpty]: Start isEmpty. Operand 1749 states and 2583 transitions.
[2019-10-13 21:24:53,080 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2019-10-13 21:24:53,080 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:53,080 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:53,081 INFO  L410      AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:53,081 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:53,081 INFO  L82        PathProgramCache]: Analyzing trace with hash 858257964, now seen corresponding path program 1 times
[2019-10-13 21:24:53,082 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:53,082 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163038417]
[2019-10-13 21:24:53,082 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:53,082 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:53,082 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:53,124 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:53,241 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:53,242 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163038417]
[2019-10-13 21:24:53,243 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:53,244 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:24:53,244 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726209232]
[2019-10-13 21:24:53,244 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:24:53,245 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:53,245 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:24:53,245 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:24:53,245 INFO  L87              Difference]: Start difference. First operand 1749 states and 2583 transitions. Second operand 3 states.
[2019-10-13 21:24:53,452 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:53,452 INFO  L93              Difference]: Finished difference Result 4577 states and 6755 transitions.
[2019-10-13 21:24:53,452 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:24:53,453 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 151
[2019-10-13 21:24:53,454 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:53,472 INFO  L225             Difference]: With dead ends: 4577
[2019-10-13 21:24:53,473 INFO  L226             Difference]: Without dead ends: 3026
[2019-10-13 21:24:53,477 INFO  L600         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
[2019-10-13 21:24:53,481 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3026 states.
[2019-10-13 21:24:53,625 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 2997.
[2019-10-13 21:24:53,626 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2997 states.
[2019-10-13 21:24:53,641 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 4373 transitions.
[2019-10-13 21:24:53,649 INFO  L78                 Accepts]: Start accepts. Automaton has 2997 states and 4373 transitions. Word has length 151
[2019-10-13 21:24:53,650 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:53,651 INFO  L462      AbstractCegarLoop]: Abstraction has 2997 states and 4373 transitions.
[2019-10-13 21:24:53,651 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:24:53,651 INFO  L276                IsEmpty]: Start isEmpty. Operand 2997 states and 4373 transitions.
[2019-10-13 21:24:53,657 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 152
[2019-10-13 21:24:53,657 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:53,658 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:53,658 INFO  L410      AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:53,659 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:53,659 INFO  L82        PathProgramCache]: Analyzing trace with hash -649393937, now seen corresponding path program 1 times
[2019-10-13 21:24:53,659 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:53,659 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755699655]
[2019-10-13 21:24:53,659 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:53,660 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:53,660 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:53,762 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:53,872 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:53,873 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755699655]
[2019-10-13 21:24:53,873 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:53,874 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:24:53,874 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953272502]
[2019-10-13 21:24:53,874 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:24:53,875 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:53,875 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:24:53,875 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:24:53,875 INFO  L87              Difference]: Start difference. First operand 2997 states and 4373 transitions. Second operand 4 states.
[2019-10-13 21:24:54,113 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:54,114 INFO  L93              Difference]: Finished difference Result 5374 states and 7862 transitions.
[2019-10-13 21:24:54,114 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-13 21:24:54,114 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 151
[2019-10-13 21:24:54,115 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:54,128 INFO  L225             Difference]: With dead ends: 5374
[2019-10-13 21:24:54,128 INFO  L226             Difference]: Without dead ends: 2563
[2019-10-13 21:24:54,133 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:24:54,137 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 2563 states.
[2019-10-13 21:24:54,262 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2563.
[2019-10-13 21:24:54,262 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 2563 states.
[2019-10-13 21:24:54,270 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 3737 transitions.
[2019-10-13 21:24:54,271 INFO  L78                 Accepts]: Start accepts. Automaton has 2563 states and 3737 transitions. Word has length 151
[2019-10-13 21:24:54,272 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:54,272 INFO  L462      AbstractCegarLoop]: Abstraction has 2563 states and 3737 transitions.
[2019-10-13 21:24:54,272 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:24:54,272 INFO  L276                IsEmpty]: Start isEmpty. Operand 2563 states and 3737 transitions.
[2019-10-13 21:24:54,277 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 153
[2019-10-13 21:24:54,277 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:54,278 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:54,278 INFO  L410      AbstractCegarLoop]: === Iteration 8 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:54,278 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:54,279 INFO  L82        PathProgramCache]: Analyzing trace with hash -341408988, now seen corresponding path program 1 times
[2019-10-13 21:24:54,279 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:54,279 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498802099]
[2019-10-13 21:24:54,279 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:54,280 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:54,280 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:54,306 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:54,374 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:54,375 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498802099]
[2019-10-13 21:24:54,375 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:54,375 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:24:54,375 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809851804]
[2019-10-13 21:24:54,376 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:24:54,376 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:54,376 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:24:54,377 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:24:54,377 INFO  L87              Difference]: Start difference. First operand 2563 states and 3737 transitions. Second operand 3 states.
[2019-10-13 21:24:54,592 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:54,592 INFO  L93              Difference]: Finished difference Result 5831 states and 8728 transitions.
[2019-10-13 21:24:54,593 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:24:54,593 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 152
[2019-10-13 21:24:54,593 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:54,609 INFO  L225             Difference]: With dead ends: 5831
[2019-10-13 21:24:54,609 INFO  L226             Difference]: Without dead ends: 3457
[2019-10-13 21:24:54,616 INFO  L600         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
[2019-10-13 21:24:54,621 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 3457 states.
[2019-10-13 21:24:54,827 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 3457 to 3395.
[2019-10-13 21:24:54,827 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3395 states.
[2019-10-13 21:24:54,839 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 5094 transitions.
[2019-10-13 21:24:54,840 INFO  L78                 Accepts]: Start accepts. Automaton has 3395 states and 5094 transitions. Word has length 152
[2019-10-13 21:24:54,840 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:24:54,840 INFO  L462      AbstractCegarLoop]: Abstraction has 3395 states and 5094 transitions.
[2019-10-13 21:24:54,840 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:24:54,841 INFO  L276                IsEmpty]: Start isEmpty. Operand 3395 states and 5094 transitions.
[2019-10-13 21:24:54,848 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2019-10-13 21:24:54,848 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:24:54,849 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:24:54,849 INFO  L410      AbstractCegarLoop]: === Iteration 9 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:24:54,849 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:24:54,850 INFO  L82        PathProgramCache]: Analyzing trace with hash 35518099, now seen corresponding path program 1 times
[2019-10-13 21:24:54,850 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:24:54,850 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252633220]
[2019-10-13 21:24:54,850 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:54,850 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:24:54,851 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:24:54,943 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:24:55,375 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:24:55,375 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252633220]
[2019-10-13 21:24:55,376 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:24:55,376 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13
[2019-10-13 21:24:55,377 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717292267]
[2019-10-13 21:24:55,378 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 13 states
[2019-10-13 21:24:55,378 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:24:55,379 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2019-10-13 21:24:55,379 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156
[2019-10-13 21:24:55,380 INFO  L87              Difference]: Start difference. First operand 3395 states and 5094 transitions. Second operand 13 states.
[2019-10-13 21:24:59,804 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:24:59,804 INFO  L93              Difference]: Finished difference Result 16024 states and 24982 transitions.
[2019-10-13 21:24:59,805 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. 
[2019-10-13 21:24:59,805 INFO  L78                 Accepts]: Start accepts. Automaton has 13 states. Word has length 155
[2019-10-13 21:24:59,805 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:24:59,862 INFO  L225             Difference]: With dead ends: 16024
[2019-10-13 21:24:59,862 INFO  L226             Difference]: Without dead ends: 12851
[2019-10-13 21:24:59,871 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=832, Unknown=0, NotChecked=0, Total=1190
[2019-10-13 21:24:59,885 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 12851 states.
[2019-10-13 21:25:00,439 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 12851 to 7992.
[2019-10-13 21:25:00,440 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 7992 states.
[2019-10-13 21:25:00,454 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 7992 states to 7992 states and 12283 transitions.
[2019-10-13 21:25:00,454 INFO  L78                 Accepts]: Start accepts. Automaton has 7992 states and 12283 transitions. Word has length 155
[2019-10-13 21:25:00,455 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:25:00,455 INFO  L462      AbstractCegarLoop]: Abstraction has 7992 states and 12283 transitions.
[2019-10-13 21:25:00,458 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 13 states.
[2019-10-13 21:25:00,458 INFO  L276                IsEmpty]: Start isEmpty. Operand 7992 states and 12283 transitions.
[2019-10-13 21:25:00,464 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2019-10-13 21:25:00,464 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:25:00,465 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:25:00,465 INFO  L410      AbstractCegarLoop]: === Iteration 10 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:25:00,465 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:25:00,466 INFO  L82        PathProgramCache]: Analyzing trace with hash -616025582, now seen corresponding path program 1 times
[2019-10-13 21:25:00,466 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:25:00,467 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936216828]
[2019-10-13 21:25:00,467 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:00,467 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:00,467 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:25:00,528 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:25:00,658 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:25:00,658 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936216828]
[2019-10-13 21:25:00,659 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:25:00,660 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2019-10-13 21:25:00,660 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807147465]
[2019-10-13 21:25:00,661 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 5 states
[2019-10-13 21:25:00,662 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:25:00,662 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2019-10-13 21:25:00,662 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:25:00,663 INFO  L87              Difference]: Start difference. First operand 7992 states and 12283 transitions. Second operand 5 states.
[2019-10-13 21:25:01,204 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:25:01,204 INFO  L93              Difference]: Finished difference Result 11513 states and 17844 transitions.
[2019-10-13 21:25:01,205 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2019-10-13 21:25:01,205 INFO  L78                 Accepts]: Start accepts. Automaton has 5 states. Word has length 155
[2019-10-13 21:25:01,205 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:25:01,215 INFO  L225             Difference]: With dead ends: 11513
[2019-10-13 21:25:01,215 INFO  L226             Difference]: Without dead ends: 4406
[2019-10-13 21:25:01,233 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42
[2019-10-13 21:25:01,237 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 4406 states.
[2019-10-13 21:25:01,520 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 4406 to 3395.
[2019-10-13 21:25:01,521 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 3395 states.
[2019-10-13 21:25:01,527 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 5079 transitions.
[2019-10-13 21:25:01,527 INFO  L78                 Accepts]: Start accepts. Automaton has 3395 states and 5079 transitions. Word has length 155
[2019-10-13 21:25:01,528 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:25:01,528 INFO  L462      AbstractCegarLoop]: Abstraction has 3395 states and 5079 transitions.
[2019-10-13 21:25:01,528 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 5 states.
[2019-10-13 21:25:01,528 INFO  L276                IsEmpty]: Start isEmpty. Operand 3395 states and 5079 transitions.
[2019-10-13 21:25:01,532 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2019-10-13 21:25:01,532 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:25:01,533 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:25:01,533 INFO  L410      AbstractCegarLoop]: === Iteration 11 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:25:01,533 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:25:01,533 INFO  L82        PathProgramCache]: Analyzing trace with hash 917941838, now seen corresponding path program 1 times
[2019-10-13 21:25:01,534 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:25:01,534 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392499397]
[2019-10-13 21:25:01,534 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:01,534 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:01,534 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:25:01,595 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:25:01,793 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:25:01,794 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392499397]
[2019-10-13 21:25:01,794 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:25:01,794 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9
[2019-10-13 21:25:01,795 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641404313]
[2019-10-13 21:25:01,795 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 9 states
[2019-10-13 21:25:01,795 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:25:01,796 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2019-10-13 21:25:01,796 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72
[2019-10-13 21:25:01,796 INFO  L87              Difference]: Start difference. First operand 3395 states and 5079 transitions. Second operand 9 states.
[2019-10-13 21:25:03,520 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:25:03,520 INFO  L93              Difference]: Finished difference Result 13649 states and 21233 transitions.
[2019-10-13 21:25:03,521 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. 
[2019-10-13 21:25:03,521 INFO  L78                 Accepts]: Start accepts. Automaton has 9 states. Word has length 155
[2019-10-13 21:25:03,521 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:25:03,543 INFO  L225             Difference]: With dead ends: 13649
[2019-10-13 21:25:03,544 INFO  L226             Difference]: Without dead ends: 10476
[2019-10-13 21:25:03,553 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=221, Unknown=0, NotChecked=0, Total=342
[2019-10-13 21:25:03,564 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10476 states.
[2019-10-13 21:25:03,971 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10476 to 6314.
[2019-10-13 21:25:03,972 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 6314 states.
[2019-10-13 21:25:03,983 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 6314 states to 6314 states and 9620 transitions.
[2019-10-13 21:25:03,983 INFO  L78                 Accepts]: Start accepts. Automaton has 6314 states and 9620 transitions. Word has length 155
[2019-10-13 21:25:03,984 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:25:03,984 INFO  L462      AbstractCegarLoop]: Abstraction has 6314 states and 9620 transitions.
[2019-10-13 21:25:03,984 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 9 states.
[2019-10-13 21:25:03,984 INFO  L276                IsEmpty]: Start isEmpty. Operand 6314 states and 9620 transitions.
[2019-10-13 21:25:03,989 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 156
[2019-10-13 21:25:03,989 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:25:03,989 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:25:03,990 INFO  L410      AbstractCegarLoop]: === Iteration 12 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:25:03,990 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:25:03,990 INFO  L82        PathProgramCache]: Analyzing trace with hash 266398157, now seen corresponding path program 1 times
[2019-10-13 21:25:03,990 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:25:03,990 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556025056]
[2019-10-13 21:25:03,991 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:03,991 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:03,991 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:25:04,175 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:25:04,283 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:25:04,284 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556025056]
[2019-10-13 21:25:04,284 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:25:04,284 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:25:04,285 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908571896]
[2019-10-13 21:25:04,285 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:25:04,286 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:25:04,286 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:25:04,286 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:25:04,286 INFO  L87              Difference]: Start difference. First operand 6314 states and 9620 transitions. Second operand 4 states.
[2019-10-13 21:25:04,805 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:25:04,805 INFO  L93              Difference]: Finished difference Result 16559 states and 25207 transitions.
[2019-10-13 21:25:04,806 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-13 21:25:04,806 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 155
[2019-10-13 21:25:04,806 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:25:04,828 INFO  L225             Difference]: With dead ends: 16559
[2019-10-13 21:25:04,828 INFO  L226             Difference]: Without dead ends: 10276
[2019-10-13 21:25:04,842 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:25:04,853 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 10276 states.
[2019-10-13 21:25:05,494 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 10276 to 10253.
[2019-10-13 21:25:05,494 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 10253 states.
[2019-10-13 21:25:05,507 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 10253 states to 10253 states and 15452 transitions.
[2019-10-13 21:25:05,507 INFO  L78                 Accepts]: Start accepts. Automaton has 10253 states and 15452 transitions. Word has length 155
[2019-10-13 21:25:05,507 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:25:05,507 INFO  L462      AbstractCegarLoop]: Abstraction has 10253 states and 15452 transitions.
[2019-10-13 21:25:05,507 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:25:05,507 INFO  L276                IsEmpty]: Start isEmpty. Operand 10253 states and 15452 transitions.
[2019-10-13 21:25:05,514 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 158
[2019-10-13 21:25:05,514 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:25:05,515 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:25:05,515 INFO  L410      AbstractCegarLoop]: === Iteration 13 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:25:05,515 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:25:05,515 INFO  L82        PathProgramCache]: Analyzing trace with hash -800612128, now seen corresponding path program 1 times
[2019-10-13 21:25:05,516 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:25:05,516 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204871797]
[2019-10-13 21:25:05,516 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:05,516 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:05,516 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:25:05,543 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:25:05,617 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:25:05,618 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204871797]
[2019-10-13 21:25:05,618 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:25:05,618 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:25:05,618 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11245886]
[2019-10-13 21:25:05,619 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:25:05,619 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:25:05,619 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:25:05,619 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:25:05,620 INFO  L87              Difference]: Start difference. First operand 10253 states and 15452 transitions. Second operand 3 states.
[2019-10-13 21:25:06,449 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:25:06,450 INFO  L93              Difference]: Finished difference Result 25879 states and 39071 transitions.
[2019-10-13 21:25:06,450 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:25:06,450 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 157
[2019-10-13 21:25:06,450 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:25:06,483 INFO  L225             Difference]: With dead ends: 25879
[2019-10-13 21:25:06,484 INFO  L226             Difference]: Without dead ends: 16012
[2019-10-13 21:25:06,505 INFO  L600         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
[2019-10-13 21:25:06,521 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 16012 states.
[2019-10-13 21:25:07,498 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 16012 to 15991.
[2019-10-13 21:25:07,499 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 15991 states.
[2019-10-13 21:25:07,518 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 15991 states to 15991 states and 23833 transitions.
[2019-10-13 21:25:07,519 INFO  L78                 Accepts]: Start accepts. Automaton has 15991 states and 23833 transitions. Word has length 157
[2019-10-13 21:25:07,519 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:25:07,519 INFO  L462      AbstractCegarLoop]: Abstraction has 15991 states and 23833 transitions.
[2019-10-13 21:25:07,519 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:25:07,519 INFO  L276                IsEmpty]: Start isEmpty. Operand 15991 states and 23833 transitions.
[2019-10-13 21:25:07,527 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 162
[2019-10-13 21:25:07,527 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:25:07,528 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:25:07,528 INFO  L410      AbstractCegarLoop]: === Iteration 14 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:25:07,528 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:25:07,528 INFO  L82        PathProgramCache]: Analyzing trace with hash 39936174, now seen corresponding path program 1 times
[2019-10-13 21:25:07,529 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:25:07,529 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543589403]
[2019-10-13 21:25:07,529 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:07,529 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:07,529 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:25:07,621 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:25:07,730 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:25:07,731 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543589403]
[2019-10-13 21:25:07,731 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:25:07,731 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:25:07,731 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861334985]
[2019-10-13 21:25:07,732 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:25:07,732 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:25:07,733 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:25:07,733 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:25:07,733 INFO  L87              Difference]: Start difference. First operand 15991 states and 23833 transitions. Second operand 4 states.
[2019-10-13 21:25:09,274 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:25:09,274 INFO  L93              Difference]: Finished difference Result 46929 states and 69966 transitions.
[2019-10-13 21:25:09,275 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. 
[2019-10-13 21:25:09,275 INFO  L78                 Accepts]: Start accepts. Automaton has 4 states. Word has length 161
[2019-10-13 21:25:09,275 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:25:09,339 INFO  L225             Difference]: With dead ends: 46929
[2019-10-13 21:25:09,340 INFO  L226             Difference]: Without dead ends: 30981
[2019-10-13 21:25:09,369 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:25:09,394 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30981 states.
[2019-10-13 21:25:11,822 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30981 to 30940.
[2019-10-13 21:25:11,823 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30940 states.
[2019-10-13 21:25:11,980 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30940 states to 30940 states and 45871 transitions.
[2019-10-13 21:25:11,981 INFO  L78                 Accepts]: Start accepts. Automaton has 30940 states and 45871 transitions. Word has length 161
[2019-10-13 21:25:11,981 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:25:11,981 INFO  L462      AbstractCegarLoop]: Abstraction has 30940 states and 45871 transitions.
[2019-10-13 21:25:11,981 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 21:25:11,981 INFO  L276                IsEmpty]: Start isEmpty. Operand 30940 states and 45871 transitions.
[2019-10-13 21:25:11,994 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 163
[2019-10-13 21:25:11,994 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:25:11,994 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:25:11,995 INFO  L410      AbstractCegarLoop]: === Iteration 15 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:25:11,995 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:25:11,995 INFO  L82        PathProgramCache]: Analyzing trace with hash 1035308930, now seen corresponding path program 1 times
[2019-10-13 21:25:11,995 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:25:11,996 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216157010]
[2019-10-13 21:25:11,996 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:11,996 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:11,996 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:25:12,013 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:25:12,063 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:25:12,063 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216157010]
[2019-10-13 21:25:12,064 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:25:12,064 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:25:12,064 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261242913]
[2019-10-13 21:25:12,064 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:25:12,065 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:25:12,065 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:25:12,065 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:25:12,065 INFO  L87              Difference]: Start difference. First operand 30940 states and 45871 transitions. Second operand 3 states.
[2019-10-13 21:25:15,703 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:25:15,704 INFO  L93              Difference]: Finished difference Result 92618 states and 137356 transitions.
[2019-10-13 21:25:15,704 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:25:15,704 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 162
[2019-10-13 21:25:15,704 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:25:15,768 INFO  L225             Difference]: With dead ends: 92618
[2019-10-13 21:25:15,769 INFO  L226             Difference]: Without dead ends: 61788
[2019-10-13 21:25:15,794 INFO  L600         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
[2019-10-13 21:25:15,845 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 61788 states.
[2019-10-13 21:25:17,725 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 61788 to 30946.
[2019-10-13 21:25:17,725 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 30946 states.
[2019-10-13 21:25:17,759 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 30946 states to 30946 states and 45877 transitions.
[2019-10-13 21:25:17,760 INFO  L78                 Accepts]: Start accepts. Automaton has 30946 states and 45877 transitions. Word has length 162
[2019-10-13 21:25:17,760 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:25:17,760 INFO  L462      AbstractCegarLoop]: Abstraction has 30946 states and 45877 transitions.
[2019-10-13 21:25:17,760 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:25:17,760 INFO  L276                IsEmpty]: Start isEmpty. Operand 30946 states and 45877 transitions.
[2019-10-13 21:25:17,772 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 164
[2019-10-13 21:25:17,772 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:25:17,772 INFO  L380         BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:25:17,772 INFO  L410      AbstractCegarLoop]: === Iteration 16 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:25:17,773 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:25:17,773 INFO  L82        PathProgramCache]: Analyzing trace with hash -1360973299, now seen corresponding path program 1 times
[2019-10-13 21:25:17,773 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:25:17,773 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296224303]
[2019-10-13 21:25:17,773 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:17,774 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:25:17,774 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:25:17,824 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:25:17,907 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 21:25:17,912 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296224303]
[2019-10-13 21:25:17,914 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:25:17,914 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 21:25:17,914 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820086105]
[2019-10-13 21:25:17,915 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 21:25:17,915 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:25:17,915 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 21:25:17,916 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 21:25:17,916 INFO  L87              Difference]: Start difference. First operand 30946 states and 45877 transitions. Second operand 4 states.